The dimension and minimum distance of two classes of primitive BCH codes

From MaRDI portal
Publication:2396760

DOI10.1016/J.FFA.2016.12.009zbMATH Open1402.94100arXiv1603.07007OpenAlexW2304375173MaRDI QIDQ2396760FDOQ2396760


Authors: Cunsheng Ding, Zhengchun Zhou, Cui Ling Fan Edit this on Wikidata


Publication date: 24 May 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes -- a family of cyclic codes -- in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, the dimension and minimum distance of these codes are not known in general. The objective of this paper is to determine the dimension and minimum distances of two classes of narrow-sense primitive BCH codes with design distances delta=(q1)qm11qlfloor(m1)/2floor and delta=(q1)qm11qlfloor(m+1)/2floor. The weight distributions of some of these BCH codes are also reported. As will be seen, the two classes of BCH codes are sometimes optimal and sometimes among the best linear codes known.


Full work available at URL: https://arxiv.org/abs/1603.07007




Recommendations




Cites Work


Cited In (50)





This page was built for publication: The dimension and minimum distance of two classes of primitive BCH codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396760)