Moshe Schwartz

Comb., December, 2024

Reconstruction From Noisy Substrings.

[BibT_eX]

[DOI]

Gennian Ge

IEEE Trans. Inf. Theory, November, 2024

On duplication-free codes for disjoint or equal-length errors.

[BibT_eX]

[DOI]

Wenjun Yu

Des. Codes Cryptogr., October, 2024

Bounds on the Minimum Field Size of Network MDS Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, August, 2024

Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, June, 2024

Covert Channels Data.

[BibT_eX]

[DOI]

Alon Marzin

Michael Segal

Dataset, May, 2024

The second-order football-pool problem and the optimal rate of generalized-covering codes.

[BibT_eX]

[DOI]

J. Comb. Theory A, April, 2024

The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes.

[BibT_eX]

[DOI]

CoRR, 2024

On the Asymptotic Rate of Optimal Codes that Correct Tandem Duplications for Nanopore Sequencing.

[BibT_eX]

[DOI]

Wenjun Yu

Zuo Ye

CoRR, 2024

Repairing Schemes for Tamo-Barg Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Covert Communication by Exploiting Error-Correcting Codes.

[BibT_eX]

[DOI]

Alon Marzin

Michael Segal

Proceedings of the 20th International Conference on the Design of Reliable Communication Networks, 2024

2023

A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It.

[BibT_eX]

[DOI]

Han Cai

IEEE Trans. Inf. Theory, April, 2023

Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2023

Dimensions of Channel Coding: From Theory to Algorithms to Applications.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Optimal Reverse-Complement-Duplication Error-Correcting Codes.

[BibT_eX]

[DOI]

CoRR, 2023

Error Correction for DNA Storage.

[BibT_eX]

[DOI]

CoRR, 2023

Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

The Optimal Rate of Second-Order Generalized-Covering Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Bounds on the Essential Covering Radius of Constrained Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Designing a Public Participation Digital Architecture in Formal Policymaking Processes.

[BibT_eX]

[DOI]

Proceedings of the Design for Equality and Justice - INTERACT 2023 IFIP TC 13 Workshops, York, UK, August 28, 2023

2022

Sequence Reconstruction for Limited-Magnitude Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Improved Coding Over Sets for DNA-Based Data Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

On the Generalized Covering Radii of Reed-Muller Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

A Construction of Maximally Recoverable Codes With Order-Optimal Field Size.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Optimal Locally Repairable Codes: An Improved Bound and Constructions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

On the Reverse-Complement String-Duplication System.

[BibT_eX]

[DOI]

Eyar Ben-Tolila

IEEE Trans. Inf. Theory, 2022

Improved Rank-Modulation Codes for DNA Storage With Shotgun Sequencing.

[BibT_eX]

[DOI]

Niv Beeri

IEEE Trans. Inf. Theory, 2022

On tilings of asymmetric limited-magnitude balls.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Storage codes on triangle-free graphs with asymptotically unit rate.

[BibT_eX]

[DOI]

Alexander Barg

CoRR, 2022

2021

Uncertainty of Reconstruction With List-Decoding From Uniform-Tandem-Duplication Noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls.

[BibT_eX]

[DOI]

Xin Wang

IEEE Trans. Inf. Theory, 2021

On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

The Generalized Covering Radii of Linear Codes.

[BibT_eX]

[DOI]

Marcelo Firer

IEEE Trans. Inf. Theory, 2021

On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes.

[BibT_eX]

[DOI]

Han Cai

IEEE Trans. Inf. Theory, 2021

An Improved Bound for Optimal Locally Repairable Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Reconstruction Codes for DNA Sequences With Uniform Tandem-Duplication Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Single-Error Detection and Correction for Duplication and Substitution Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Evolution of $k$ -Mer Frequencies and Entropy in Duplication and Substitution Mutation Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

On Optimal Locally Repairable Codes With Super-Linear Length.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Hierarchical erasure correction of linear codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2020

Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication Noise.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Optimized Writing Rate in DNA Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Estimation of duplication history under a stochastic model for tandem repeats.

[BibT_eX]

[DOI]

BMC Bioinform., December, 2019

Locality and Availability of Array Codes Constructed From Subspaces.

[BibT_eX]

[DOI]

Natalia Silberstein

IEEE Trans. Inf. Theory, 2019

Rank-Modulation Codes for DNA Storage With Shotgun Sequencing.

[BibT_eX]

[DOI]

Netanel Raviv

IEEE Trans. Inf. Theory, 2019

The Entropy Rate of Some Pólya String Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

An efficient shift rule for the prefer-max De Bruijn sequence.

[BibT_eX]

[DOI]

Discret. Math., 2019

On Embedding De Bruijn Sequences by Increasing the Alphabet Size.

[BibT_eX]

[DOI]

Yotam Svoray

Gera Weiss

CoRR, 2019

On the Access Complexity of PIR Schemes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Network Coding Solutions for the Combination Network and its Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Infinity-Norm Permutation Covering Codes From Cyclic Groups.

[BibT_eX]

[DOI]

Ronen Karni

IEEE Trans. Inf. Theory, 2018

On Encoding Semiconstrained Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

On Independence and Capacity of Multidimensional Semiconstrained Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Erasure Correction of Scalar Codes in the Presence of Stragglers.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Evolution of N-Gram Frequencies Under Duplication and Substitution Mutations.

[BibT_eX]

[DOI]

Hao Lou

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

File Updates Under Random/Arbitrary Insertions and Deletions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric.

[BibT_eX]

[DOI]

Pascal O. Vontobel

IEEE Trans. Inf. Theory, 2017

Coding for the ℓ<sub>∞</sub>-Limited Permutation Channel.

[BibT_eX]

[DOI]

Michael Langberg

IEEE Trans. Inf. Theory, 2017

Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms.

[BibT_eX]

[DOI]

Siddharth Jain

IEEE Trans. Inf. Theory, 2017

Rank modulation codes for DNA storage.

[BibT_eX]

[DOI]

Netanel Raviv

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Noise and uncertainty in string-duplication systems.

[BibT_eX]

[DOI]

Siddharth Jain

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Non-linear cyclic codes that attain the Gilbert-Varshamov bound.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Multidimensional semiconstrained systems.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

The Capacity of String-Duplication Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Bounds for Permutation Rate-Distortion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Semiconstrained Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

The capacity of some Pólya string models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Systematic Error-Correcting Codes for Rank Modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Bounds on the size of balls over permutations with the infinity metric.

[BibT_eX]

[DOI]

Pascal O. Vontobel

Proceedings of the IEEE International Symposium on Information Theory, 2015

Coding for the ℓ∞-limited permutation channel.

[BibT_eX]

[DOI]

Michael Langberg

Proceedings of the IEEE International Symposium on Information Theory, 2015

A stochastic model for genomic interspersed duplication.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Gray Codes and Enumerative Coding for Vector Spaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

On the non-existence of lattice tilings by quasi-crosses.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors.

[BibT_eX]

[DOI]

Torleiv Kløve

Des. Codes Cryptogr., 2014

Linear covering codes and error-correcting codes for limited-magnitude errors.

[BibT_eX]

[DOI]

Torleiv Kløve

Des. Codes Cryptogr., 2014

Semi-constrained Systems.

[BibT_eX]

[DOI]

CoRR, 2014

The Capacity of String-Replication Systems.

[BibT_eX]

[DOI]

CoRR, 2014

Rate-Distortion for Ranking with Incomplete Information.

[BibT_eX]

[DOI]

CoRR, 2014

Construction of Partial MDS (PMDS) and Sector-Disk (SD) Codes with Two Global Parity Symbols.

[BibT_eX]

[DOI]

CoRR, 2014

Quasi-linear network coding.

[BibT_eX]

[DOI]

Muriel Médard

Proceedings of the International Symposium on Network Coding, 2014

Partial MDS (PMDS) and Sector-Disk (SD) codes that tolerate the erasure of two random sectors.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Trajectory Codes for Flash Memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Generalized Gray Codes for Local Rank Modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Gray codes for vector spaces

[BibT_eX]

[DOI]

CoRR, 2013

Sequence reconstruction for Grassmann graphs and permutations.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Snake-in-the-Box Codes for Rank Modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

On the Labeling Problem of Permutation Group Codes Under the Infinity Metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Quasi-Cross Lattice Tilings With Applications to Flash Memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

2011

New Bounds on the Capacity of Multidimensional Run-Length Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Constant-Weight Gray Codes for Local Rank Modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Optimal permutation anticodes with the infinity norm via permanents of (0, 1)-matrices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

On optimal anticodes over permutations with the infinity norm.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

2010

Correcting limited-magnitude errors in the rank-modulation scheme.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On the capacity of the precision-resolution system.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Correcting charge-constrained errors in the rank-modulation scheme.

[BibT_eX]

[DOI]

Anxiao Jiang

IEEE Trans. Inf. Theory, 2010

Codes for asymmetric limited-magnitude errors with application to multilevel flash memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On the Size of Optimal Anticodes over Permutations with the Infinity Norm

[BibT_eX]

[DOI]

CoRR, 2010

Constant-weight Gray codes for local rank modulation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Rank modulation for flash memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Universal rewriting in constrained memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Constrained Codes as Networks of Relations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Error-correcting codes for rank modulation.

[BibT_eX]

[DOI]

Anxiao Jiang

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Distributed broadcasting and mapping protocols in directed anonymous networks.

[BibT_eX]

[DOI]

Michael Langberg

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Codes for Multi-Level Flash Memories: Correcting Asymmetric Limited-Magnitude Errors.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

On the stopping distance and the stopping redundancy of codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Optimal tristance anticodes in certain graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

On the Capacity of Precision-Resolution Constrained Systems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2006

2005

Two-dimensional cluster-correcting codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On the asymptotic performance of iterative decoders for product codes.

[BibT_eX]

[DOI]

Paul H. Siegel

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Tilings, anticodes, and multidimensional coding.

[BibT_eX]

[DOI]

PhD thesis, 2004

Perfect Constant-Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Two-dimensional burst-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Optimal 2-Dimensional 3-Dispersion Lattices.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2003

2002

Codes and Anticodes in the Grassman Graph.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

1999

The structure of single-track Gray codes.

[BibT_eX]

[DOI]