Zero Set of Ternary 3- Error- Correcting BCH Type Codes
Keywords:
Minimum distance, zeros, BCH code and parity check matrix, cyclic codeAbstract
As suggested by Kasami in the 1970s, instead of the BCH Code, different zeros can be used to construct triple-error-correcting codes. Additionally, some new zero sets were discovered by Bracken and Helleseth (2009) resulting in the formulation of triple-error-correcting codes. These triples were found by Kasami and Bracken for the binary triple-error-correcting code. In the present study ,the focus is on the ternary triple-error-correcting BCH type code and a few new triple-error-correcting codes having zeros and and where gcd (m, n) =1 has been suggested
