FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2963733306> ?p ?o ?g. }

• W2963733306 abstract "We study two basic problems regarding edit errors (insertions and deletions). The first one is document exchange, where two parties Alice and Bob hold two strings x and y with a bounded edit distance k. The goal is to have Alice send a short sketch to Bob, so that Bob can recover x based on y and the sketch. The second one is the fundamental problem of designing error correcting codes for edit errors, where the goal is to construct an explicit code to transmit a message x through a channel that can add at most k worst case insertions and deletions, so that the original message x can be successfully recovered at the other end of the channel. Both problems have been extensively studied for decades, and in this paper we focus on deterministic document exchange protocols and binary codes for insertions and deletions (insdel codes). If the length of x is n, then it is known that for small k (e.g., k ≤ n/4), in both problems the optimal sketch size or the optimal number of redundant bits is Θ(k log n/k). In particular, this implies the existence of binary codes that can correct ε fraction of insertions and deletions with rate 1-Θ(ε log (1/ε). However, known constructions are far from achieving these bounds. In this paper we significantly improve previous results on both problems. For document exchange, we give an efficient deterministic protocol with sketch size O(k log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n/k). This significantly improves the previous best known deterministic protocol, which has sketch size O(k <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> + k log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n) [2]. For binary insdel codes, we obtain the following results: 1) An explicit binary insdel code which encodes an n-bit message x against k errors with redundancy O(k log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n/k). In particular this implies an explicit family of binary insdel codes that can correct ε fraction of insertions and deletions with rate 1-O(ε log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> 1/(1-ε))=1-Õ(ε). This significantly improves the previous best known result which only achieves rate 1-Õ(√ε) [11], [10], and is optimal up to a log (1/ε) factor. 1) An explicit binary insdel code which encodes an n-bit message x against k errors with redundancy O(k log n). This significantly improves the previous best known result of [4], which only works for constant k and has redundancy O(k <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> log k log n); and that of [2], which has redundancy O(k <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> + k log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n). Our code has optimal redundancy for k ≤ n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1-α</sup> , any constant 0 <; α <; 1. This is the first explicit construction of binary insdel codes that has optimal redundancy for a wide range of error parameters k, and this brings our understanding of binary insdel codes much closer to that of standard binary error correcting codes. In obtaining our results we introduce several new techniques. Most notably, we introduce the notion of ε-self matching hash functions and ε-synchronization hash functions. We believe our techniques can have further applications in the literature." @default.
• W2963733306 created "2019-07-30" @default.
• W2963733306 creator A5005453022 @default.
• W2963733306 creator A5014279694 @default.
• W2963733306 creator A5022526821 @default.
• W2963733306 creator A5090382335 @default.
• W2963733306 date "2018-10-01" @default.
• W2963733306 modified "2023-10-18" @default.
• W2963733306 title "Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors" @default.
• W2963733306 cites W1544713780 @default.
• W2963733306 cites W2029448413 @default.
• W2963733306 cites W2105597036 @default.
• W2963733306 cites W2108572348 @default.
• W2963733306 cites W2153672863 @default.
• W2963733306 cites W2163137752 @default.
• W2963733306 cites W2963044831 @default.
• W2963733306 cites W2963132305 @default.
• W2963733306 cites W2963700977 @default.
• W2963733306 cites W2964011803 @default.
• W2963733306 cites W4211074540 @default.
• W2963733306 cites W4300176985 @default.
• W2963733306 doi "https://doi.org/10.1109/focs.2018.00028" @default.
• W2963733306 hasPublicationYear "2018" @default.
• W2963733306 type Work @default.
• W2963733306 sameAs 2963733306 @default.
• W2963733306 citedByCount "54" @default.
• W2963733306 countsByYear W29637333062017 @default.
• W2963733306 countsByYear W29637333062018 @default.
• W2963733306 countsByYear W29637333062019 @default.
• W2963733306 countsByYear W29637333062020 @default.
• W2963733306 countsByYear W29637333062021 @default.
• W2963733306 countsByYear W29637333062022 @default.
• W2963733306 countsByYear W29637333062023 @default.
• W2963733306 crossrefType "proceedings-article" @default.
• W2963733306 hasAuthorship W2963733306A5005453022 @default.
• W2963733306 hasAuthorship W2963733306A5014279694 @default.
• W2963733306 hasAuthorship W2963733306A5022526821 @default.
• W2963733306 hasAuthorship W2963733306A5090382335 @default.
• W2963733306 hasBestOaLocation W29637333062 @default.
• W2963733306 hasConcept C11413529 @default.
• W2963733306 hasConcept C114614502 @default.
• W2963733306 hasConcept C118615104 @default.
• W2963733306 hasConcept C134306372 @default.
• W2963733306 hasConcept C177264268 @default.
• W2963733306 hasConcept C199360897 @default.
• W2963733306 hasConcept C2776760102 @default.
• W2963733306 hasConcept C2779231336 @default.
• W2963733306 hasConcept C33923547 @default.
• W2963733306 hasConcept C34388435 @default.
• W2963733306 hasConcept C41008148 @default.
• W2963733306 hasConcept C44359876 @default.
• W2963733306 hasConcept C48372109 @default.
• W2963733306 hasConcept C80444323 @default.
• W2963733306 hasConcept C94375191 @default.
• W2963733306 hasConceptScore W2963733306C11413529 @default.
• W2963733306 hasConceptScore W2963733306C114614502 @default.
• W2963733306 hasConceptScore W2963733306C118615104 @default.
• W2963733306 hasConceptScore W2963733306C134306372 @default.
• W2963733306 hasConceptScore W2963733306C177264268 @default.
• W2963733306 hasConceptScore W2963733306C199360897 @default.
• W2963733306 hasConceptScore W2963733306C2776760102 @default.
• W2963733306 hasConceptScore W2963733306C2779231336 @default.
• W2963733306 hasConceptScore W2963733306C33923547 @default.
• W2963733306 hasConceptScore W2963733306C34388435 @default.
• W2963733306 hasConceptScore W2963733306C41008148 @default.
• W2963733306 hasConceptScore W2963733306C44359876 @default.
• W2963733306 hasConceptScore W2963733306C48372109 @default.
• W2963733306 hasConceptScore W2963733306C80444323 @default.
• W2963733306 hasConceptScore W2963733306C94375191 @default.
• W2963733306 hasLocation W29637333061 @default.
• W2963733306 hasLocation W29637333062 @default.
• W2963733306 hasOpenAccess W2963733306 @default.
• W2963733306 hasPrimaryLocation W29637333061 @default.
• W2963733306 hasRelatedWork W2094108224 @default.
• W2963733306 hasRelatedWork W2355938306 @default.
• W2963733306 hasRelatedWork W2373724792 @default.
• W2963733306 hasRelatedWork W2551359169 @default.
• W2963733306 hasRelatedWork W2577690138 @default.
• W2963733306 hasRelatedWork W2949660516 @default.
• W2963733306 hasRelatedWork W2951043270 @default.
• W2963733306 hasRelatedWork W3204597924 @default.
• W2963733306 hasRelatedWork W2482057383 @default.
• W2963733306 hasRelatedWork W2788172935 @default.
• W2963733306 isParatext "false" @default.
• W2963733306 isRetracted "false" @default.
• W2963733306 magId "2963733306" @default.
• W2963733306 workType "article" @default.