Skip to content
Journal of Mathematical and Computational Science ISSN 1927-5307 (Print)

Archives › Volume 6, Number 6 (2016)

J. Math. Comput. Sci. 6 (2016), 1169–1176

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

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

PDF (328.2Β KB)

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.

Published
26 October 2016
Volume
6 (2016)
License
CC BY 3.0

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.

Cite this article

R. K. Narula, O. P. Vinocha, A. Kumar, A class of non-binary BCH code of Bose and minimum distance, J. Math. Comput. Sci. 6 (2016), 1169–1176.

BibTeX
@article{Narula2016,
  author  = {Narula, Rajesh Kumar and Vinocha, O.P. and Kumar, Ajay},
  title   = {A class of non-binary BCH code of Bose and minimum distance},
  journal = {J. Math. Comput. Sci.},
  volume  = {6},
  year    = {2016},
  pages   = {1169--1176},
  doi     = {}
}