Image de couverture de livre

Robust Gray Codes Approaching the Optimal Rate

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Con, Roni, Fathollahi, Dorsa, Gabrys, Ryan, Wootters, Mary, Yaakobi, Eitan
Format:	Preprint
Publié:	2024
Sujets:	Information Theory Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved Construction of Robust Gray Code
par: Fathollahi, Dorsa, et autres
Publié: (2024)

Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem
par: Abraham, Hadas, et autres
Publié: (2026)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
par: Con, Roni, et autres
Publié: (2024)

One Code Fits All: Strong stuck-at codes for versatile memory encoding
par: Con, Roni, et autres
Publié: (2024)

An Additive Approximation Scheme for Generating Dyadic Codings for the Outputs of an LLM
par: Bar-Lev, Daniella, et autres
Publié: (2026)

Capacity-Achieving Gray Codes
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Interactive Coding with Small Memory and Improved Rate
par: Fathollahi, Dorsa, et autres
Publié: (2024)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
par: Bruno, Roberto, et autres
Publié: (2025)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
par: Li, Xin, et autres
Publié: (2024)

Learning DNF through Generalized Fourier Representations
par: Heidari, Mohsen, et autres
Publié: (2025)

Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation
par: Gupta, Shivam, et autres
Publié: (2023)

Improved Approximation Algorithms for Index Coding
par: Chawin, Dror, et autres
Publié: (2024)

Old and New Results on Alphabetic Codes
par: Bruno, Roberto, et autres
Publié: (2025)

Towards Optimal Grammars for RNA Structures
par: Onokpasa, Evarista, et autres
Publié: (2024)

Kernels for Storage Capacity and Dual Index Coding
par: Haviv, Ishay
Publié: (2025)

Investigations on Algorithm Selection for Interval-Based Coding Methods
par: Strutz, Tilo, et autres
Publié: (2024)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
par: Bruno, Roberto, et autres
Publié: (2024)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
par: Ashvinkumar, Vikrant, et autres
Publié: (2025)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
par: Peikert, Chris, et autres
Publié: (2025)

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
par: Brakensiek, Joshua, et autres
Publié: (2025)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
par: Alaoui, Ziad Ismaili, et autres
Publié: (2026)

Improved Constructions of Linear Codes for Insertions and Deletions
par: Gross, Roee, et autres
Publié: (2025)

Satisfying the Restricted Isometry Property with the Optimal Number of Rows and Slightly Less Randomness
par: Rao, Shravas
Publié: (2023)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
par: Guruswami, Venkatesan, et autres
Publié: (2023)

Unbounded Error Correcting Codes
par: Efremenko, Klim, et autres
Publié: (2024)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
par: Li, Guokai, et autres
Publié: (2026)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
par: Ahmadypour, Niloufar, et autres
Publié: (2020)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
par: Singhvi, Shubhransh, et autres
Publié: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
par: Goldenberg, Elazar, et autres
Publié: (2024)

Improved Decoding of Tanner Codes
par: Zhou, Zhaienhe, et autres
Publié: (2025)

Optimality of Frequency Moment Estimation
par: Braverman, Mark, et autres
Publié: (2024)

Entropy Coding of Unordered Data Structures
par: Kunze, Julius, et autres
Publié: (2024)

Learning Partitions with Optimal Query and Round Complexities
par: Black, Hadley, et autres
Publié: (2025)

Sample-Optimal Private Regression in Polynomial Time
par: Anderson, Prashanti, et autres
Publié: (2025)

Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes
par: Beelen, Peter, et autres
Publié: (2025)

Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages
par: Asi, Hilal, et autres
Publié: (2024)

A probabilistic analysis on general probabilistic scheduling problems
par: Suruga, Daiki
Publié: (2024)