Image de couverture de livre

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Guo, Zeyu, Raj, Roshan, Shangguan, Chong, Zhang, Zihan
Format:	Preprint
Publié:	2026
Sujets:	Information Theory Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
par: Brakensiek, Joshua, et autres
Publié: (2025)

Outer Strong Blocking Sets
par: Alfarano, Gianira N., et autres
Publié: (2023)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
par: Guo, Zeyu, et autres
Publié: (2024)

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
par: Shangguan, Chong, et autres
Publié: (2026)

Approximate generalized Steiner systems and near-optimal constant weight codes
par: Liu, Miao, et autres
Publié: (2024)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
par: Chen, Yeyuan, 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)

Constrained coding upper bounds via Goulden-Jackson cluster theorem
par: Shen, Yuanting, et autres
Publié: (2024)

Near optimal constructions of frameproof codes
par: Liu, Miao, et autres
Publié: (2024)

Focal-free uniform hypergraphs and codes
par: Huang, Xinqi, et autres
Publié: (2024)

When can an expander code correct $Ω(n)$ errors in $O(n)$ time?
par: Cheng, Kuan, et autres
Publié: (2023)

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

Schubert Subspace Codes
par: Alfarano, Gianira N., et autres
Publié: (2024)

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

Explicit constructions of optimal blocking sets and minimal codes
par: Bishnoi, Anurag, et autres
Publié: (2024)

Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts
par: Iyer, Rishabh
Publié: (2026)

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

Block components of generalized quaternion group codes
par: Willenborg, Nadja
Publié: (2025)

Explicit determination of a class of permutation rational functions in any characteristic
par: Li, Yi, et autres
Publié: (2026)

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
par: Bar-Lev, Daniella
Publié: (2026)

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
par: Cotardo, Giuseppe, et autres
Publié: (2024)

Polynomial Invariants of q-Matroids and Rank-Metric Codes
par: Gluesing-Luerssen, Heide, et autres
Publié: (2025)

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
par: Wu, Binghong, et autres
Publié: (2026)

Transfer Operators and Independence Polynomials for Strong Powers of Circulant Graphs
par: Hildebrant, Todd
Publié: (2026)

Rank-metric codes over arbitrary fields: Bounds and constructions
par: Neri, Alessandro, et autres
Publié: (2026)

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
par: Couvée, Hugo Beeloo-Sauerbier, et autres
Publié: (2024)

Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
par: Brakensiek, Joshua, et autres
Publié: (2025)

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
par: Zhao, Ziyang, et autres
Publié: (2026)

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

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

Symmetric Tensor Decompositions over Finite Fields
par: Cotardo, Giuseppe, et autres
Publié: (2026)

The generalized trifference problem
par: Bishnoi, Anurag, et autres
Publié: (2025)

Construction of CCC and ZCCS Through Additive Characters Over Galois Field
par: Ghosh, Gobinda, et autres
Publié: (2024)

Matroidal Entropy Functions: Constructions, Characterizations and Representations
par: Chen, Qi, et autres
Publié: (2023)

The Support Designs of Several Families of Lifted Linear Codes
par: Ding, Cunsheng, et autres
Publié: (2024)

The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
par: Bertuzzo, Matteo, et autres
Publié: (2026)

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

Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs
par: Ly, Hoang, et autres
Publié: (2025)

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
par: Sarkar, Palash, et autres
Publié: (2024)

On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
par: Yu, Wenjun, et autres
Publié: (2025)