Cover Image

The Support Designs of Several Families of Lifted Linear Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ding, Cunsheng, Sun, Zhonghua, Yan, Qianqian
Format:	Preprint
Published:	2024
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

More MDS codes of non-Reed-Solomon type
by: Wu, Yansheng, et al.
Published: (2024)

Near-Optimal List-Recovery of Linear Code Families
by: Li, Ray, et al.
Published: (2025)

A Sequence Construction of Cyclic Codes over Finite Fields
by: Ding, Cunsheng
Published: (2016)

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

On the Minimum Distances of Some Families of Goppa Codes and BCH Codes
by: Chen, Yaqi, et al.
Published: (2026)

On the Minimum Distances of Some Families of BCH Codes
by: Chen, Yaqi, et al.
Published: (2026)

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

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
by: Liu, Hengfeng, et al.
Published: (2025)

Self-Dual Cyclic Codes with Square-Root-Like Lower Bounds on Their Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

A Family of Low-Complexity Binary Codes with Constant Hamming Weights
by: Sasidharan, Birenjith, et al.
Published: (2024)

The Exact Parameters of A Family of BCH Codes
by: Sun, Zhonghua
Published: (2025)

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

Two classes of constacyclic codes with a square-root-like lower bound
by: Chen, Tingfang, et al.
Published: (2024)

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

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

Repeated-Root Cyclic Codes with Optimal Parameters or Best Parameters Known
by: Chen, Hao, et al.
Published: (2024)

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

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
by: Yu, Wenjun, et al.
Published: (2025)

On H-Intersecting Graph Families and Counting of Homomorphisms
by: Sason, Igal
Published: (2025)

Cyclic and Negacyclic Sum-Rank Codes
by: Chen, Hao, et al.
Published: (2024)

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)

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

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

Linear rank-metric intersecting codes
by: Bartoli, Daniele, et al.
Published: (2025)

Polynomials, Divided Differences, and Codes
by: Venkitesh, S.
Published: (2024)

The Eigenvalue Method in Coding Theory
by: Abiad, Aida, et al.
Published: (2025)

$t$-Balanced Codes with the Kendall-$τ$ Metric
by: Jany, Benjamin, et al.
Published: (2024)

Intersecting Codes and the Connectivity of $q$-Matroids
by: Conca, Fabrizio, et al.
Published: (2026)

The Service Rate Region of Hamming Codes
by: Choudhary, Priyanka, et al.
Published: (2025)

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

The Geometry of Codes for Random Access in DNA Storage
by: Gruica, Anina, et al.
Published: (2024)

Codes with restricted overlaps: expandability, constructions, and bounds
by: Stanovnik, Lidija
Published: (2024)

A Survey on Codes from Simplicial Complexes
by: Wu, Yansheng, et al.
Published: (2024)

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

Binary Caps and LCD Codes with Large Dimensions
by: Ishizuka, Keita, et al.
Published: (2026)

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

On Duplication-Free Codes for Disjoint or Equal-Length Errors
by: Yu, Wenjun, et al.
Published: (2024)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
by: Berend, Hagai, et al.
Published: (2025)

Improved Johnson-type Bounds for Insertion-Deletion Codes
by: Yang, Yulin
Published: (2026)

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