Alexander Barg

Entropy, November, 2023

Bounds for the sum of distances of spherical sets of small size.

[BibT_eX]

[DOI]

Peter G. Boyvalenkov

Maya Stoyanova

Discret. Math., May, 2023

A family of permutationally invariant quantum codes.

[BibT_eX]

[DOI]

Arda Aydin

Max A. Alekseyev

CoRR, 2023

Storage codes and recoverable systems on lines and grids.

[BibT_eX]

[DOI]

CoRR, 2023

Quantum spherical codes.

[BibT_eX]

[DOI]

CoRR, 2023

Node Repair for Adversarial Graphical Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Node Repair on Connected Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Recoverable Systems.

[BibT_eX]

[DOI]

Ohad Elishco

IEEE Trans. Inf. Theory, 2022

High-Rate Storage Codes on Triangle-Free Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

A construction of maximally recoverable codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

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

[BibT_eX]

[DOI]

Moshe Schwartz

Lev Yohananov

CoRR, 2022

Node repair on connected graphs, Part II.

[BibT_eX]

[DOI]

CoRR, 2022

On the size of maximal binary codes with 2, 3, and 4 distances.

[BibT_eX]

[DOI]

CoRR, 2022

Interior-point regenerating codes on graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Recoverable systems on lines and grids.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Capacity of Dynamical Storage Systems.

[BibT_eX]

[DOI]

Ohad Elishco

IEEE Trans. Inf. Theory, 2021

Cyclic and Convolutional Codes With Locality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Bounds for discrepancies in the Hamming space.

[BibT_eX]

[DOI]

Maxim Skriganov

J. Complex., 2021

Regenerating codes on graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Capacity and Construction of Recoverable Systems.

[BibT_eX]

[DOI]

Ohad Elishco

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2020

Error Correction Based on Partial Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Enabling Optimal Access and Error Correction for the Repair of Reed-Solomon Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Stolarsky's invariance principle for finite metric spaces.

[BibT_eX]

[DOI]

CoRR, 2020

Cyclic LRC codes with hierarchy and availability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Repair of RS codes with optimal access and error correction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Codes With Hierarchical Locality From Covering Maps of Curves.

[BibT_eX]

[DOI]

Sean Ballentine

Serge G. Vladut

IEEE Trans. Inf. Theory, 2019

Explicit constructions of MSR codes for the rack-aware storage model.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Construction of Polar Codes for Arbitrary Discrete Memoryless Channels.

[BibT_eX]

[DOI]

Talha Cihad Gülcü

IEEE Trans. Inf. Theory, 2018

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Exploiting Locality for Improved Decoding of Binary Cyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2018

Optimal locally private estimation under 𝓁<sub>p</sub> loss for 1≤ p≤ 2.

[BibT_eX]

[DOI]

CoRR, 2018

The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size.

[BibT_eX]

[DOI]

CoRR, 2018

Optimal LRC codes for all lenghts n≤q.

[BibT_eX]

[DOI]

CoRR, 2018

Optimal MDS codes for cooperative repair.

[BibT_eX]

[DOI]

CoRR, 2018

Codes on Curves with Hierarchical Locality.

[BibT_eX]

[DOI]

Sean Ballentine

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

Optimal Regenerating Codes for Cooperative Repair.

[BibT_eX]

[DOI]

Srinivasan Narayanamurthy

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

Clay Codes: Moulding MDS Codes to Yield an MSR Code.

[BibT_eX]

[DOI]

Syed Hussain

Siddhartha Nandi

Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018

The repair problem under connectivity constraints: Explicit MSR codes for the rack-aware model of distributed storage.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component.

[BibT_eX]

[DOI]

Talha Cihad Gülcü

IEEE Trans. Inf. Theory, 2017

Locally Recoverable Codes on Algebraic Curves.

[BibT_eX]

[DOI]

Serge G. Vladut

IEEE Trans. Inf. Theory, 2017

Group Testing Schemes From Codes and Designs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures.

[BibT_eX]

[DOI]

CoRR, 2017

Asymptotically optimal private estimation under mean square loss.

[BibT_eX]

[DOI]

CoRR, 2017

Locally recoverable codes from algebraic curves and surfaces.

[BibT_eX]

[DOI]

Anthony Várilly-Alvarado

CoRR, 2017

Optimal schemes for discrete distribution estimation under local differential privacy.

[BibT_eX]

[DOI]

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

Fractional decoding: Error correction from partial information.

[BibT_eX]

[DOI]

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

A study on the impact of locality in the decoding of binary cyclic codes.

[BibT_eX]

[DOI]

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

Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Bounds on the Parameters of Locally Recoverable Codes.

[BibT_eX]

[DOI]

Alexey A. Frolov

IEEE Trans. Inf. Theory, 2016

Interactive function computation via polar coding.

[BibT_eX]

[DOI]

Talha Cihad Gülcü

Alexander M. Barg

Probl. Inf. Transm., 2016

Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes.

[BibT_eX]

[DOI]

Int. J. Inf. Coding Theory, 2016

Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Group testing schemes from low-weight codewords of BCH codes.

[BibT_eX]

[DOI]

Shashanka Ubaru

Proceedings of the IEEE International Symposium on Information Theory, 2016

Combinatorial and LP bounds for LRC codes.

[BibT_eX]

[DOI]

Sihuang Hu

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Restricted Isometry Property of Random Subdictionaries.

[BibT_eX]

[DOI]

Rongrong Wang

IEEE Trans. Inf. Theory, 2015

Almost disjunct matrices from codes and designs.

[BibT_eX]

[DOI]

CoRR, 2015

Polar codes for distributed hierarchical source coding.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

Polar codes using dynamic kernels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Cyclic LRC codes and their subfield subcodes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

A Family of Optimal Locally Recoverable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Linear codes on posets with extension property.

[BibT_eX]

[DOI]

Marcos Vinicius Spreafico

Luciano Vianna Felix

Marcelo Firer

Discret. Math., 2014

Bounds on locally recoverable codes with multiple recovering sets.

[BibT_eX]

[DOI]

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

Universal source polarization and an application to a multi-user problem.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Polar Codes for $q$-Ary Channels, $q=2^{r}$.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Constructions of Rank Modulation Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Robust Parent-Identifying Codes and Combinatorial Arrays.

[BibT_eX]

[DOI]

Grigory Kabatiansky

IEEE Trans. Inf. Theory, 2013

New Bounds for Spherical Two-Distance Sets.

[BibT_eX]

[DOI]

Wei-Hsuan Yu

Exp. Math., 2013

Random Subdictionaries and Coherence Conditions for Sparse Signal Recovery

[BibT_eX]

[DOI]

Rongrong Wang

CoRR, 2013

Association schemes on general measure spaces and zero-dimensional Abelian groups.

[BibT_eX]

[DOI]

Maxim Skriganov

CoRR, 2013

Controlled polarization for q-ary alphabets.

[BibT_eX]

[DOI]

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

New bounds for equiangular lines.

[BibT_eX]

[DOI]

Wei-Hsuan Yu

Proceedings of the Discrete Geometry and Algebraic Combinatorics, 2013

2012

Polar codes for q-ary channels, q=2<sup>r</sup>.

[BibT_eX]

[DOI]

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

Translation association schemes, poset metrics, and the shape enumerator of codes.

[BibT_eX]

[DOI]

Marcelo Firer

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

2011

Fingerprinting.

[BibT_eX]

[DOI]

Gregory A. Kabatiansky

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Coding for High-Density Recording on a 1-D Granular Magnetic Medium.

[BibT_eX]

[DOI]

Navin Kashyap

IEEE Trans. Inf. Theory, 2011

On the Number of Errors Correctable with Codes on Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Bounds on sets with few distances.

[BibT_eX]

[DOI]

Oleg R. Musin

J. Comb. Theory, Ser. A, 2011

The ordered Hamming metric and ordered symmetric channels.

[BibT_eX]

[DOI]

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

Channels with intermittent errors.

[BibT_eX]

[DOI]

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

General constructions of deterministic (S)RIP matrices for compressive sampling.

[BibT_eX]

[DOI]

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

List decoding of product codes by the MinSum algorithm.

[BibT_eX]

[DOI]

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

Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption - (Invited Talk).

[BibT_eX]

[DOI]

Grigory Kabatiansky

Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Multilevel polarization for nonbinary codes and parallel channels.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Parameters of rank modulation codes: Examples.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Sparse recovery properties of statistical RIP matrices.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Secret Key Generation for a Pairwise Independent Network Model.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Codes in permutations and error correction for rank modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Robust parent-identifying codes.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Coding for high-density magnetic recording.

[BibT_eX]

[DOI]