Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guo, Zeyu, Raj, Roshan, Shangguan, Chong, Zhang, Zihan
Format:	Preprint
Published:	2026
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)

Outer Strong Blocking Sets
by: Alfarano, Gianira N., et al.
Published: (2023)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
by: Guo, Zeyu, et al.
Published: (2024)

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)

Approximate generalized Steiner systems and near-optimal constant weight codes
by: Liu, Miao, et al.
Published: (2024)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

Constrained coding upper bounds via Goulden-Jackson cluster theorem
by: Shen, Yuanting, et al.
Published: (2024)

Near optimal constructions of frameproof codes
by: Liu, Miao, et al.
Published: (2024)

Focal-free uniform hypergraphs and codes
by: Huang, Xinqi, et al.
Published: (2024)

When can an expander code correct $Ω(n)$ errors in $O(n)$ time?
by: Cheng, Kuan, et al.
Published: (2023)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

Schubert Subspace Codes
by: Alfarano, Gianira N., et al.
Published: (2024)

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

Explicit constructions of optimal blocking sets and minimal codes
by: Bishnoi, Anurag, et al.
Published: (2024)

Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts
by: Iyer, Rishabh
Published: (2026)

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Block components of generalized quaternion group codes
by: Willenborg, Nadja
Published: (2025)

Explicit determination of a class of permutation rational functions in any characteristic
by: Li, Yi, et al.
Published: (2026)

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
by: Bar-Lev, Daniella
Published: (2026)

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
by: Cotardo, Giuseppe, et al.
Published: (2024)

Polynomial Invariants of q-Matroids and Rank-Metric Codes
by: Gluesing-Luerssen, Heide, et al.
Published: (2025)

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
by: Wu, Binghong, et al.
Published: (2026)

Transfer Operators and Independence Polynomials for Strong Powers of Circulant Graphs
by: Hildebrant, Todd
Published: (2026)

Rank-metric codes over arbitrary fields: Bounds and constructions
by: Neri, Alessandro, et al.
Published: (2026)

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)

Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
by: Brakensiek, Joshua, et al.
Published: (2025)

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
by: Zhao, Ziyang, et al.
Published: (2026)

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

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

Symmetric Tensor Decompositions over Finite Fields
by: Cotardo, Giuseppe, et al.
Published: (2026)

The generalized trifference problem
by: Bishnoi, Anurag, et al.
Published: (2025)

Construction of CCC and ZCCS Through Additive Characters Over Galois Field
by: Ghosh, Gobinda, et al.
Published: (2024)

Matroidal Entropy Functions: Constructions, Characterizations and Representations
by: Chen, Qi, et al.
Published: (2023)

The Support Designs of Several Families of Lifted Linear Codes
by: Ding, Cunsheng, et al.
Published: (2024)

The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
by: Bertuzzo, Matteo, et al.
Published: (2026)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
by: Li, Xin, et al.
Published: (2024)

Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs
by: Ly, Hoang, et al.
Published: (2025)

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
by: Sarkar, Palash, et al.
Published: (2024)

On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
by: Yu, Wenjun, et al.
Published: (2025)