The following pages link to Eitan Yaakobi (Q346497):
Displaying 50 items.
- Approximate sorting of data streams with limited storage (Q346499) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Duplication-correcting codes (Q1727344) (← links)
- Multiset combinatorial batch codes (Q1791675) (← links)
- PIR codes with short block length (Q2657142) (← links)
- Concurrent Use of Write-Once Memory (Q2835021) (← links)
- Approximate Sorting of Data Streams with Limited Storage (Q2920482) (← links)
- Binary Linear Locally Repairable Codes (Q2976506) (← links)
- Information-Theoretic Sneak-Path Mitigation in Memristor Crossbar Arrays (Q2976603) (← links)
- Systematic Error-Correcting Codes for Permutations and Multi-Permutations (Q2976760) (← links)
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols (Q2976852) (← links)
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels (Q2976878) (← links)
- On the Capacity of Constrained Permutation Codes for Rank Modulation (Q2976886) (← links)
- Codes for Partially Stuck-At Memory Cells (Q2976988) (← links)
- Codes Correcting Erasures and Deletions for Rank Modulation (Q2977041) (← links)
- Rank-Modulation Rewrite Coding for Flash Memories (Q2977326) (← links)
- Correcting Grain-Errors in Magnetic Media (Q2978602) (← links)
- Generalized Sphere Packing Bound (Q2978607) (← links)
- High Sum-Rate Three-Write and Nonbinary WOM Codes (Q2983342) (← links)
- Short <inline-formula> <tex-math notation="TeX">\(Q\) </tex-math></inline-formula>-Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation (Q2986267) (← links)
- Optimized Cell Programming for Flash Memories With Quantizers (Q2986389) (← links)
- Graded Bit-Error-Correcting Codes With Applications to Flash Memory (Q2989319) (← links)
- Codes for Write-Once Memories (Q2989793) (← links)
- Coding for Racetrack Memories (Q4559583) (← links)
- Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel (Q4566595) (← links)
- Consecutive Switch Codes (Q4569198) (← links)
- Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction (Q4569203) (← links)
- (Q4570859) (← links)
- Rank-Modulation Codes for DNA Storage With Shotgun Sequencing (Q4611413) (← links)
- Nearly Optimal Constructions of PIR and Batch Codes (Q4615354) (← links)
- Reconstruction of Sequences Over Non-Identical Channels (Q4615389) (← links)
- Repeat-Free Codes (Q4958262) (← links)
- Error-Correction of Multidimensional Bursts (Q4975753) (← links)
- Covering Codes Using Insertions or Deletions (Q5001724) (← links)
- Codes Over Trees (Q5001743) (← links)
- Reconstruction of Strings From Their Substrings Spectrum (Q5001797) (← links)
- Coding for Sequence Reconstruction for Single Edits (Q5030268) (← links)
- Array Codes for Functional PIR and Batch Codes (Q5030326) (← links)
- Multi-Server Weakly-Private Information Retrieval (Q5030357) (← links)
- Partial MDS Codes With Regeneration (Q5032507) (← links)
- On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions (Q5032564) (← links)
- Private Proximity Retrieval Codes (Q5032587) (← links)
- Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications (Q5032624) (← links)
- Criss-Cross Insertion and Deletion Correcting Codes (Q5032638) (← links)
- Lifted Reed-Solomon Codes and Lifted Multiplicity Codes (Q5032642) (← links)
- Clustering-Correcting Codes (Q5080012) (← links)
- Endurance-Limited Memories: Capacity and Codes (Q5080014) (← links)
- Multiple Criss-Cross Insertion and Deletion Correcting Codes (Q5088506) (← links)
- Bounds and Constructions of Codes Over Symbol-Pair Read Channels (Q5123792) (← links)
- Coding Over Sets for DNA Storage (Q5123860) (← links)
