Cover Image

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alrabiah, Omar, Guruswami, Venkatesan, Li, Ray
Format:	Preprint
Published:	2023
Subjects:	Information Theory Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

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

Tight Bounds for Sparsifying Random CSPs
by: Brakensiek, Joshua, et al.
Published: (2025)

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
by: Liang, Xue-Bin
Published: (2024)

On the Codebook Design for NOMA Schemes from Bent Functions
by: Li, Chunlei, et al.
Published: (2025)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)

Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
by: Mizunuma, Yuto, et al.
Published: (2026)

The Labeled Coupon Collector Problem
by: Tan, Andrew, et al.
Published: (2025)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
by: Yu, Lei
Published: (2025)

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

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

Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024)

Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
by: Wu, Huawei
Published: (2026)

Optimizing alphabet reduction pairs of arrays
by: Culus, Jean-François, et al.
Published: (2024)

Constructing MRD codes by switching
by: Shi, Minjia, et al.
Published: (2022)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
by: Brakensiek, Joshua, et al.
Published: (2026)

Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $τ$-Metric
by: Nguyen, The
Published: (2024)

When does a bent concatenation not belong to the completed Maiorana-McFarland class?
by: Kudin, Sadmir, et al.
Published: (2024)

Automated Discovery of Improved Constant Weight Binary Codes
by: Rosin, Christopher D.
Published: (2026)

Millions of inequivalent quadratic APN functions in eight variables
by: Beierle, Christof, et al.
Published: (2025)

Nearly Orthogonal Sets over Finite Fields
by: Chawin, Dror, et al.
Published: (2024)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

New bounds for the optimal density of covering single-insertion codes via the Turán density
by: Pikhurko, Oleg, et al.
Published: (2024)

A comprehensive generalization of the Friendship Paradox to weights and attributes
by: Evtushenko, Anna, et al.
Published: (2024)

The capacity of a finite field matrix channel
by: Blackburn, Simon R., et al.
Published: (2022)

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

Average Case Analysis of Leaf-Centric Binary Tree Sources
by: Benkner, Louisa Seelbach, et al.
Published: (2018)