Generalization of zero set of non-binary triple error correcting BCH type code
Abstract
In our previous paper [6] we constructed some zero set {1 ,3m + 1,3 2m+ 1} and {1, 3m + 1, 33m + 1} and proved that these set represented the zeros of triple error correcting code in non binary case. In this work, we proposed the sufficient condition for the existence of zero set {1,3l + 1,3 kl + 1} of Non binary triple –error-correcting code having gcd (𝑙,𝑛) =1.
Copyright © 2016 Ajay Kumar, Rajesh Kumar Narula, O.P. Vinocha. 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
A. Kumar, R. K. Narula, O. P. Vinocha, Generalization of zero set of non-binary triple error correcting BCH type code, J. Math. Comput. Sci. 6 (2016), 1204–1209.
BibTeX
@article{Kumar2016,
author = {Kumar, Ajay and Narula, Rajesh Kumar and Vinocha, O.P.},
title = {Generalization of zero set of non-binary triple error correcting BCH type code},
journal = {J. Math. Comput. Sci.},
volume = {6},
year = {2016},
pages = {1204--1209},
doi = {}
}