DocumentCode :
1759577
Title :
The Bose and Minimum Distance of a Class of BCH Codes
Author :
Cunsheng Ding ; Xiaoni Du ; Zhengchun Zhou
Author_Institution :
Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong, China
Volume :
61
Issue :
5
fYear :
2015
fDate :
42125
Firstpage :
2351
Lastpage :
2356
Abstract :
Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms. Bose-Ray-Chaudhuri-Hocquenghem (BCH) codes form a subclass of cyclic codes and are very important in both theory and practice as they have good error-correcting capability and are widely used in communication systems, storage devices, and consumer electronics. However, the dimension and minimum distance of BCH codes are not known in general. The objective of this paper is to determine the Bose and minimum distances of a class of narrow-sense primitive BCH codes.
Keywords :
BCH codes; cyclic codes; decoding; error correction codes; linear codes; BCH code minimum distance; Bose-Ray-Chaudhuri-Hocquenghem code; communication system; consumer electronic; cyclic code; decoding algorithm; encoding; error-correcting capability; linear code; storage device; Educational institutions; Electronic mail; Generators; Linear codes; Polynomials; Reed-Solomon codes; BCH codes; cyclic codes; linear codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2015.2409838
Filename :
7056532
Link To Document :
بازگشت