Imagen de Portada

Explicit Constant-Alphabet Subspace Design Codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Goyal, Rohan, Guruswami, Venkatesan, Hsieh, Jun-Ting
Formato:	Preprint
Publicado:	2026
Materias:	Information Theory Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Explicit optimal-length locally repairable codes of distance 5
por: Beemer, Allison, et al.
Publicado: (2018)

Communication with Imperfectly Shared Randomness
por: Canonne, Clément L., et al.
Publicado: (2014)

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

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
por: Bhattiprolu, Vijay, et al.
Publicado: (2024)

Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
por: Goyal, Rohan, et al.
Publicado: (2025)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
por: Goyal, Rohan, et al.
Publicado: (2023)

Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the $\sqrt{n}$ Dimension Threshold
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

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

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

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

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

New constructions of pseudorandom codes
por: Ghentiyala, Surendra, et al.
Publicado: (2024)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
por: Goldenberg, Elazar, et al.
Publicado: (2024)

Oblivious Deletion Codes
por: Con, Roni, et al.
Publicado: (2025)

Strong Inapproximability for a Promise Rank Problem
por: Guruswami, Venkatesan, et al.
Publicado: (2026)

Baby PIH: Parameterized Inapproximability of Min CSP
por: Guruswami, Venkatesan, et al.
Publicado: (2023)

PCP-free APX-Hardness of Nearest Codeword and Minimum Distance
por: Bhattiprolu, Vijay, et al.
Publicado: (2025)

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs
por: Guruswami, Venkatesan, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
por: Doron, Dean, et al.
Publicado: (2024)

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

Classification of Non-redundancy of Boolean Predicates of Arity 4
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Maximal Recoverability: A Nexus of Coding Theory
por: Brakensiek, Joshua, et al.
Publicado: (2026)

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

A Pair of Bayesian Network Structures has Undecidable Conditional Independencies
por: Li, Cheuk Ting
Publicado: (2024)

Hardness of Learning Boolean Functions from Label Proportions
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

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

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

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