Cover Image

Infinitely many families of distance-optimal binary linear codes with respect to the sphere packing bound

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Hao, Xie, Conghui, Ding, Cunsheng
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound
by: Wang, Xiaoqiang, et al.
Published: (2026)

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

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

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

Minimum distances of binary optimal LCD codes of dimension five are completely determined
by: Liu, Yang, et al.
Published: (2022)

Code distances: a new family of invariants of linear codes
by: Camps-Moreno, Eduardo, et al.
Published: (2025)

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)

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

Infinite families of optimal and minimal codes over rings using simplicial complexes
by: Wu, Yanan, et al.
Published: (2024)

New record-breaking binary linear codes constructed from group codes
by: Yu, Cong, et al.
Published: (2024)

Linear Codes from Projective Linear Anticodes Revisited
by: Chen, Hao, et al.
Published: (2024)

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

Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound
by: Brehm, Martijn, et al.
Published: (2025)

Infinite families of constacyclic codes supporting 3-designs and their applications in coding theory
by: Hu, Hongsheng, et al.
Published: (2026)

New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
by: Kiermaier, Michael, et al.
Published: (2015)

Stiefel manifolds and upper bounds for spherical codes and packings
by: Zargar, Masoud
Published: (2024)

$t$-Fold $s$-Blocking Sets and $s$-Minimal Codes
by: Chen, Hao, et al.
Published: (2025)

The augmented codes of a family of linear codes with locality 2
by: Heng, Ziling, et al.
Published: (2024)

On the suboptimality of linear codes for binary distributed hypothesis testing
by: Girish, Adway, et al.
Published: (2026)

On the size of maximal binary codes with 2, 3, and 4 distances
by: Barg, Alexander, et al.
Published: (2022)

On the weight distribution of random binary linear codes
by: Linial, Nati, et al.
Published: (2018)

Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)

Constructions of binary self-orthogonal singly-even minimal linear codes violating the Aschikhmin-Barg condition with few weights
by: Li, Kangquan, et al.
Published: (2025)

A family of linear codes that are either non-GRS MDS codes or NMDS codes
by: Li, Yang, et al.
Published: (2024)

On the error correction of iterative bounded distance decoding of generalized LDPC codes
by: Burshtein, David
Published: (2025)

New bounds for codes over Gaussian integers based on the Mannheim distance
by: Shi, Minjia, et al.
Published: (2026)

Improvement of the square-root low bounds on the minimum distances of BCH codes and Matrix-product codes
by: Wang, Xiaoqiang, et al.
Published: (2025)

Minimal Linear Codes Violating the Ashikhmin-Barg Condition from Arbitrary Projective Linear Codes
by: Chen, Hao, et al.
Published: (2025)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

A lower bound on the field size of convolutional codes with a maximum distance profile and an improved construction
by: Chen, Zitan
Published: (2023)

Improved bounds and optimal constructions of pure quantum locally recoverable codes
by: Li, Yang, et al.
Published: (2025)

Shortest self-orthogonal embeddings of binary linear codes
by: An, Junmin, et al.
Published: (2025)

Shortest LCD embeddings of binary, ternary and quaternary linear codes
by: An, Junmin, et al.
Published: (2026)

The minimum distance of the antiprimitive BCH code with designed distance 3
by: Xu, Haojie, et al.
Published: (2025)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)

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

New constructions of $2$-to-$1$ mappings over $\gf_{2^n}$ and their applications to binary linear codes
by: Li, Yaqin, et al.
Published: (2025)