Cover Image

Self-Dual Cyclic Codes with Square-Root-Like Lower Bounds on Their Minimum Distances

Fuente: arXiv

Saved in:

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

Similar Items

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

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

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

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

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

Cyclic and Negacyclic Codes with Optimal and Best Known Minimum Distances
by: Chen, Hao, 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)

Infinitely many families of distance-optimal binary linear codes with respect to the sphere packing bound
by: Chen, Hao, 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)

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

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

Strong Singleton-Like Bounds, Quasi-Perfect Codes and Distance-Optimal Codes in the Sum-Rank Metric
by: Liu, Chao, 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)

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)

Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes
by: Kasai, Kenta
Published: (2026)

Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors
by: Dastbasteh, Reza, et al.
Published: (2025)

Weight Distribution of Repeated-Root Cyclic Codes with Prime Power Lengths
by: Zhao, Wei, et al.
Published: (2023)

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

Some constructions of non-generalized Reed-Solomon MDS Codes
by: Abdukhalikov, Kanat, 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)

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

Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity
by: Liu, Wenhao, et al.
Published: (2024)

New Channel Coding Lower Bounds for Noisy Permutation Channels
by: Feng, Lugaoze, et al.
Published: (2024)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
by: Brakensiek, Joshua, et al.
Published: (2025)

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

Derivation of Mutual Information and Linear Minimum Mean-Square Error for Viterbi Decoding of Convolutional Codes Using the Innovations Method
by: Tajima, Masato
Published: (2024)

Construction of Self-Orthogonal Quasi-Cyclic Codes and Their Application to Quantum Error-Correcting Codes
by: Gao, Mengying, et al.
Published: (2025)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
by: Ge, Songping, et al.
Published: (2025)

Lower Bounds on Conversion Bandwidth for MDS Convertible Codes in Split Regime
by: Wang, Lewen, et al.
Published: (2025)

SC-LDPC Codes Over $\mathbb{F}_q$: Minimum Distance, Decoding Analysis and Threshold Saturation
by: Lyu, Jiaxin, et al.
Published: (2025)

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

Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration
by: Guan, Chaofeng, et al.
Published: (2025)

Tight Lower Bounds on the Bandwidth Cost of MDS Convertible Codes in the Split Regime
by: Singhvi, Shubhransh, et al.
Published: (2025)

Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
by: Rabeti, Sheida, et al.
Published: (2026)

Extremal Self-Dual Codes and Linear Complementary Dual Codes from Double Circulant Codes
by: Han, Wenyu, et al.
Published: (2025)

Lower Bounds on Pauli Manipulation Detection Codes
by: Ichikawa, Keiya, et al.
Published: (2025)

On the Existence of Cyclic Lattice Codes
by: Luo, Chengpin, et al.
Published: (2024)

Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
by: Wang, Lewen, et al.
Published: (2025)