article
Roots of triple error correcting codes with bch resembling domain
International Journal of Statistics and Applied Mathematics · 2017 · Vol. 2(5) · pp. 82–85
Abstract
Cyclic codes are most studied error correcting codes among the families of codes in coding theory. Vinocha and Kumar (2013) discovered some new zero set leading to the triple-error-correcting codes. In the present proposed work, we study on a new zero set of triple error correcting codes like BCH Code and proposed some new roots of error correcting code having roots {1, 32a + 1, 34a + 1} and {1, 32a + 1, 36a + 1} where gcd (2a, n) = 1.
Coding theory and cryptographyQuantum-Dot Cellular AutomataQuantum Computing Algorithms and ArchitectureBCH codeReed–Solomon error correctionError detection and correctionMathematicsLinear codeDiscrete mathematicsCyclic codeBlock codeAlgorithmComputer science
Citations
0
FWCI
0.00
field-weighted impact
References
4
Percentile
28%
vs. same field & year
Related articles
On the property of properness in the extended triple-error-correcting BCH codes
International Journal of Statistics and Applied Mathematics · 2018 · 0 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.