Dimensions of some LCD BCH codes
Hanglong Zhang, Xiwang Cao

TL;DR
This paper studies the dimensions of LCD BCH codes with specific lengths and large designed distances, providing new formulas and bounds that improve upon existing minimum distance estimates.
Contribution
It determines the dimensions of certain LCD BCH codes with lengths related to q^m+1 and provides sharper lower bounds on their minimum distances.
Findings
Explicit dimension formulas for LCD BCH codes of specified lengths.
Determination of code dimensions for a range of designed distances.
Improved lower bounds on minimum distances compared to BCH bounds.
Abstract
In this paper, we investigate the first few largest coset leaders modulo where and is an odd prime power, and give the dimensions of some LCD BCH codes of length with large designed distances.We also determine the dimensions of some LCD BCH codes of length with designed distances , where and . The LCD BCH codes presented in this paper have a sharper lower bound on the minimum distance than the BCH bound.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cancer Mechanisms and Therapy
