Cover Image

On the Minimum Distances of Some Families of BCH Codes

Fuente: arXiv

Saved in:

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

Similar Items

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

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

Cyclic and BCH Codes whose Minimum Distance Equals their Maximum BCH bound
by: Bernal, José Joaquín, et al.
Published: (2024)

Concatenated Sum-Rank Codes
by: Lao, Huimin, et al.
Published: (2026)

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

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

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

The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes
by: Shany, Yaron, et al.
Published: (2024)

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

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
by: Berman, Amit, et al.
Published: (2023)

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

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

Apparent Distance and a Notion of BCH Multivariate Codes
by: Bernal, José Joaquín, et al.
Published: (2024)

Infinitely many families of distance-optimal binary linear codes with respect to the sphere packing bound
by: Chen, Hao, et al.
Published: (2025)

Cyclic and Negacyclic Codes with Optimal and Best Known Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

Some constructions of non-generalized Reed-Solomon MDS Codes
by: Abdukhalikov, Kanat, et al.
Published: (2025)

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

On Minimum Distances for Error Correction and Detection of Generalized Network Code
by: Chen, Yulin, et al.
Published: (2026)

Quasi-BP for BCH Codes and its Optimization
by: Li, Guangwen
Published: (2026)

Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes
by: Chen, Hao
Published: (2024)

On de Bruijn Array Codes Part II: Linear Codes
by: Blackburn, Simon, et al.
Published: (2025)

Upper Bounds on the Minimum Distance of Structured LDPC Codes
by: Arnault, François, et al.
Published: (2025)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
by: Berman, Amit, et al.
Published: (2026)

Properties and Decoding of Twisted GRS Codes and Their Extensions
by: Li, Yang, et al.
Published: (2025)

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)

A Structural Characterization of Cyclotomic Cosets with Applications to Affine-Invariant Codes and BCH Codes
by: Zheng, Xiongkun, et al.
Published: (2026)

On the Error Rate of Binary BCH Codes under Error-and-erasure Decoding
by: Miao, Sisi, et al.
Published: (2025)

Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes
by: Sukmadji, Alvin Y., et al.
Published: (2024)

Effective Application of Normalized Min-Sum Decoding for Short BCH Codes
by: Li, Guangwen, et al.
Published: (2024)

New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance
by: Zheng, Lingqi, et al.
Published: (2025)

On the Performance of Short Binary BCH Codes for Ultra-Low Latency Wireless Communications
by: Morelos-Zaragoza, Robert, et al.
Published: (2024)

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

The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes
by: Yohananov, Lev, et al.
Published: (2024)

Quantum $(r,δ)$-Locally Recoverable BCH and Homothetic-BCH Codes
by: Galindo, Carlos, et al.
Published: (2026)

Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
by: Peng, Qingqing, et al.
Published: (2025)

Quantum Constacyclic BCH Codes over Qudits: A Spectral-Domain Approach
by: Patel, Shikha, et al.
Published: (2024)

On the Minimum Distances of Finite-Length Lifted Product Quantum LDPC Codes
by: Raveendran, Nithin, et al.
Published: (2025)

The dual codes of two families of BCH codes
by: Xu, Haojie, et al.
Published: (2024)

New quantum codes from homothetic-BCH codes
by: Galindo, Carlos, et al.
Published: (2025)

The dual codes of two classes of LCD BCH codes
by: Fu, Yuqing, et al.
Published: (2024)