A class of non-binary BCH code of Bose and minimum distance

Rajesh Kumar Narula, O.P. Vinocha, Ajay Kumar

Abstract


BCH Code is most famous code in the field of coding theory because they have very effective encoding and decoding algorithms. These codes are best considered as cyclic codes. But from the last two decades there is not much progress over the minimum distance of BCH code. To calculate the minimum distance of BCH code is a well-known problem in general. We studied on the dimension of narrow sense Non-binary BCH code (𝑞, 𝑢, 𝑟2l−4 + 1) and also find out the Bose Distance of non-binary BCH code of design distance 𝛿 = 𝑞2l + 1.


Full Text: PDF

How to Cite this Article:

Rajesh Kumar Narula, O.P. Vinocha, Ajay Kumar, A class of non-binary BCH code of Bose and minimum distance, Journal of Mathematical and Computational Science, Vol 6, No 6 (2016), 1169-1176

Copyright © 2016 Rajesh Kumar Narula, O.P. Vinocha, Ajay Kumar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org

 

Copyright ©2017 JMCS