Cover Image

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Doron, Dean, Mosheiff, Jonathan, Wootters, Mary
Format:	Preprint
Published:	2024
Subjects:	Information Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

LDPC Codes Achieve List Decoding Capacity
by: Mosheiff, Jonathan, et al.
Published: (2019)

Tracing AG Codes: Toward Meeting the Gilbert-Varshamov Bound
by: Cohen, Gil, et al.
Published: (2025)

Punctured Low-Bias Codes Behave Like Random Linear Codes
by: Guruswami, Venkatesan, et al.
Published: (2021)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
by: Doron, Dean, et al.
Published: (2024)

Nearly-Linear Time Seeded Extractors with Short Seeds
by: Doron, Dean, et al.
Published: (2024)

Improvement of the Gilbert-Varshamov Bound for Linear Codes and Quantum Codes
by: Yuan, Chen, et al.
Published: (2026)

List-Recovery of Random Linear Codes over Small Fields
by: Doron, Dean, et al.
Published: (2025)

High Rate Multivariate Polynomial Evaluation Codes
by: Kopparty, Swastik, et al.
Published: (2024)

Explicit Codes approaching Generalized Singleton Bound using Expanders
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
by: Block, Alexander R., et al.
Published: (2026)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2021)

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
by: Moradi, Mohsen, et al.
Published: (2024)

Bounds for list-decoding and list-recovery of random linear codes
by: Guruswami, Venkatesan, et al.
Published: (2020)

Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound
by: Kasai, Kenta
Published: (2026)

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
by: Janzer, Oliver, et al.
Published: (2024)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
by: Goyal, Keshav, et al.
Published: (2024)

Random Gilbert-Varshamov Codes for Joint Source-Channel Coding
by: Moeini, AmirPouya, et al.
Published: (2026)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
by: Cohen, Gil, et al.
Published: (2025)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
by: Alrabiah, Omar, et al.
Published: (2024)

Oblivious Deletion Codes
by: Con, Roni, et al.
Published: (2025)

Decoding Balanced Linear Codes With Preprocessing
by: Bogdanov, Andrej, et al.
Published: (2025)

Advances in List Decoding of Polynomial Codes
by: Kumar, Mrinal, et al.
Published: (2026)

Explicit Constant-Alphabet Subspace Design Codes
by: Goyal, Rohan, et al.
Published: (2026)

Improved List Size for Folded Reed-Solomon Codes
by: Srivastava, Shashank
Published: (2024)

The Optimization of Random Tree Codes for Limited Computational Resources
by: Bacinoglu, B. Tan
Published: (2025)

Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
by: Fawzi, Omar, et al.
Published: (2023)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
by: Drucker, Andrew, et al.
Published: (2024)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
by: Goyal, Rohan, et al.
Published: (2025)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
by: Jeronimo, Fernando Granha, et al.
Published: (2026)

Threshold rates for properties of random codes
by: Guruswami, Venkatesan, et al.
Published: (2020)

When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs
by: Cheng, Kuan, et al.
Published: (2026)

Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes
by: First, Uriya A., et al.
Published: (2024)

Low-Degree Polynomials Are Good Extractors
by: Alrabiah, Omar, et al.
Published: (2024)

An exposition of recent list-size bounds of FRS Codes
by: Garg, Abhibhav, et al.
Published: (2025)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
by: Brakensiek, Joshua, et al.
Published: (2022)

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
by: Golowich, Louis, et al.
Published: (2024)

Interactive Coding with Small Memory and Improved Rate
by: Fathollahi, Dorsa, et al.
Published: (2024)

Algebra in Algorithmic Coding Theory
by: Sudan, Madhu
Published: (2025)

Improved Construction of Robust Gray Code
by: Fathollahi, Dorsa, et al.
Published: (2024)