Image de couverture de livre

Threshold rates for properties of random codes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Guruswami, Venkatesan, Mosheiff, Jonathan, Resch, Nicolas, Silas, Shashwat, Wootters, Mary
Format:	Preprint
Publié:	2020
Sujets:	Information Theory Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Bounds for list-decoding and list-recovery of random linear codes
par: Guruswami, Venkatesan, et autres
Publié: (2020)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

LDPC Codes Achieve List Decoding Capacity
par: Mosheiff, Jonathan, et autres
Publié: (2019)

Redundancy Is All You Need (for CSP Sparsification)
par: Brakensiek, Joshua, et autres
Publié: (2024)

Punctured Low-Bias Codes Behave Like Random Linear Codes
par: Guruswami, Venkatesan, et autres
Publié: (2021)

On Worst-Case Optimal Polynomial Intersection
par: Sun, Yihang, et autres
Publié: (2026)

Tight Bounds for Sparsifying Random CSPs
par: Brakensiek, Joshua, et autres
Publié: (2025)

Universal cycle constructions for k-subsets and k-multisets
par: Campbell, Colin, et autres
Publié: (2026)

Optimal Erasure Codes and Codes on Graphs
par: Chen, Yeyuan, et autres
Publié: (2025)

Generalized Three and Four Person Hat Game
par: van Uem, Theo
Publié: (2017)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
par: Wang, Shuche, et autres
Publié: (2024)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
par: Gabrić, Daniel, et autres
Publié: (2024)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
par: Mizunuma, Yuto, et autres
Publié: (2026)

The Labeled Coupon Collector Problem
par: Tan, Andrew, et autres
Publié: (2025)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
par: Gabric, Daniel, et autres
Publié: (2026)

Reconstructing graphs with subgraph compositions
par: Dailly, Antoine, et autres
Publié: (2025)

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

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
par: Goyal, Keshav, et autres
Publié: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
par: Goyal, Keshav, et autres
Publié: (2024)

Improved Upper Bound for the Size of a Trifferent Code
par: Bhandari, Siddharth, et autres
Publié: (2024)

On the Codebook Design for NOMA Schemes from Bent Functions
par: Li, Chunlei, et autres
Publié: (2025)

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

Constructing MRD codes by switching
par: Shi, Minjia, et autres
Publié: (2022)

The Repetition Threshold for Rote Sequences
par: Ollinger, Nicolas, et autres
Publié: (2024)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
par: Aigner-Horev, Elad, et autres
Publié: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
par: Wang, Geyang, et autres
Publié: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
par: Wang, Geyang, et autres
Publié: (2026)

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

On the weight distribution of random binary linear codes
par: Linial, Nati, et autres
Publié: (2018)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
par: Brakensiek, Joshua, et autres
Publié: (2026)

When does a bent concatenation not belong to the completed Maiorana-McFarland class?
par: Kudin, Sadmir, et autres
Publié: (2024)

Automated Discovery of Improved Constant Weight Binary Codes
par: Rosin, Christopher D.
Publié: (2026)

Millions of inequivalent quadratic APN functions in eight variables
par: Beierle, Christof, et autres
Publié: (2025)

Nearly Orthogonal Sets over Finite Fields
par: Chawin, Dror, et autres
Publié: (2024)

The Fundamental Limits of Recovering Planted Subgraphs
par: Lee, Daniel, et autres
Publié: (2025)

On Threshold Compatibility Graphs
par: Hakim, Sheikh Azizul, et autres
Publié: (2026)

Exact Thresholds for Noisy Non-Adaptive Group Testing
par: Chen, Junren, et autres
Publié: (2024)

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
par: Bangachev, Kiril, et autres
Publié: (2024)

Repetition Threshold for Binary Automatic Sequences
par: Allouche, J. -P., et autres
Publié: (2024)

Six Permutation Patterns Force Quasirandomness
par: Crudele, Gabriel, et autres
Publié: (2023)