Author : O.P Vinocha and Ajay Kumar

In 1970’s Kasami proposed an idea that triple error correcting codes can be constructed by using different zero than the BCH Code. Furthermore, Bracken and Helleseth [2009] discovered some new zero set leading to triple-error-correcting codes. Kasami and Bracken find these triples for the binary triple error correcting Code .In this work, we study on ternary triple error correcting BCH type Code and proposed some new triple error correcting code having zeros { } and { } where gcd (m, n) =1.

Keywords: Minimum distance, zeros, BCH code and parity check matrix, cyclic code

Article published in International Journal of Current  Engineering  and Technology, Vol.4,No.1 (Feb- 2014)