Imagen de Portada

New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zheng, Lingqi, Fang, Weijun, Qiu, Rongxing
Formato:	Preprint
Publicado:	2025
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

New constructions of MDS symbol-pair codes via simple-root cyclic codes
por: Qiu, Rongxing, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

Construction of MDS Euclidean Self-Dual Codes via Multiple Subsets
por: Meng, Weirong, et al.
Publicado: (2025)

The Distance Spectrum of IEEE 802.11 Binary Convolutional Codes
por: Pulikkoonattu, Rethna
Publicado: (2026)

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
por: Shi, Haoming, et al.
Publicado: (2025)

Construction and Decoding of Convolutional Codes with optimal Column Distances
por: Lieb, Julia, et al.
Publicado: (2026)

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

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

On the Hamming Distance and LCD Properties of Binary Polycyclic Codes and Their Duals
por: Bansal, Sujata, et al.
Publicado: (2026)

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

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

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

New Constructions of Optimal $(r,δ)$-LRCs via Algebraic Function Fields
por: Gao, Yuan, et al.
Publicado: (2025)

A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble
por: Guruswami, Venkatesan, et al.
Publicado: (2023)

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

Simultaneous Rational Number Codes: Decoding Beyond Half the Minimum Distance with Multiplicities and Bad Primes
por: Abbondati, Matteo, et al.
Publicado: (2025)

Simultaneous Rational Function Codes: Improved Analysis Beyond Half the Minimum Distance with Multiplicities and Poles
por: Abbondati, Matteo, et al.
Publicado: (2025)

Research on the Construction of Maximum Distance Separable Codes via Arbitrary twisted Generalized Reed-Solomon Codes
por: Zhao, Chun'e, et al.
Publicado: (2024)

Minimum Hellinger Distance Estimators for Complex Survey Designs
por: Kepplinger, David, et al.
Publicado: (2025)

Function-Correcting Codes with Homogeneous Distance
por: Liu, Huiying, et al.
Publicado: (2025)

Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach
por: Qiu, Jing, et al.
Publicado: (2026)

Algorithms for Computing the Free Distance of Convolutional Codes
por: Abreu, Zita, et al.
Publicado: (2024)

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

Three Classes of Twisted Gabidulin Codes with Different Twists
por: Li, Ran, et al.
Publicado: (2025)

Scaling Law Tradeoff Between Throughput and Sensing Distance in Large ISAC Networks
por: Qiu, Min, et al.
Publicado: (2025)

Strong Singleton-Like Bounds, Quasi-Perfect Codes and Distance-Optimal Codes in the Sum-Rank Metric
por: Liu, Chao, et al.
Publicado: (2026)

Deep Holes of Twisted Reed-Solomon Codes
por: Fang, Weijun, et al.
Publicado: (2024)

Two Classes of Quantum MDS Codes with Large Minimal Distance
por: Wang, Puyin, et al.
Publicado: (2024)

Recursively Extended Permutation Codes under Chebyshev Distance
por: Hirobe, Tomoya, et al.
Publicado: (2024)

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

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
por: Schaller, Michael, et al.
Publicado: (2025)

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

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