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

Cyclic Reed–Solomon codes, a type of BCH codes, are widely used in consumer electronics, communication systems, and data storage devices. 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 thei...

Full description

Saved in:
Bibliographic Details
Published in:Finite fields and their applications 2017-05, Vol.45, p.237-263
Main Authors: Ding, Cunsheng, Fan, Cuiling, Zhou, Zhengchun
Format: Article
Language:English
Subjects:
BCH codes
Cyclic codes
Linear codes
Secret sharing
Weight distribution
Weight enumerator
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Cyclic Reed–Solomon codes, a type of BCH codes, are widely used in consumer electronics, communication systems, and data storage devices. 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 designed distances δ=(q−1)qm−1−1−q⌊(m−1)/2⌋ and δ=(q−1)qm−1−1−q⌊(m+1)/2⌋. 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.
ISSN:1071-5797
1090-2465
DOI:10.1016/j.ffa.2016.12.009