Triple-Error-Correcting BCH-Like Codes

Details Triple-Error-Correcting BCH-Like Codes Triple-Error-Correcting BCH-Like Codes

2009-01-13

arxiv.org/abs/0901.1827v1

Computer Science

Information Theory

7 pages, submitted to ISIT 2009

Scientific paper

The binary primitive triple-error-correcting BCH code is a cyclic code of minimum distance 7 with generator polynomial having zeros $\alpha$, $\alpha^3$ and $\alpha^5$ where $\alpha$ is a primitive root of unity. The zero set of the code is said to be {1,3,5}. In the 1970's Kasami showed that one can construct similar triple-error-correcting codes using zero sets consisting of different triples than the BCH codes. Furthermore, in 2000 Chang et. al. found new triples leading to triple-error-correcting codes. In this paper a new such triple is presented. In addition a new method is presented that may be of interest in finding further such triples.

Affiliated with

Also associated with

No associations

Rating

Triple-Error-Correcting BCH-Like Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Triple-Error-Correcting BCH-Like Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triple-Error-Correcting BCH-Like Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72353