Triple-Error-Correcting BCH-Like Codes
| dc.creator | Bracken, Carl | |
| dc.creator | Helleseth, Tor | |
| dc.date | 2009-01-13 | |
| dc.date.accessioned | 2026-07-07T12:29:01Z | |
| dc.date.available | 2026-07-07T12:29:01Z | |
| dc.description | The binary primitive triple-error-correcting BCH code is a cyclic code of minimum distance 7 with generator polynomial having zeros $α$, $α^3$ and $α^5$ where $α$ 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. | |
| dc.description | 7 pages, submitted to ISIT 2009 | |
| dc.identifier | https://arxiv.org/abs/0901.1827 | |
| dc.identifier | http://arxiv.org/abs/0901.1827 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/215735 | |
| dc.subject | Information Theory | |
| dc.title | Triple-Error-Correcting BCH-Like Codes | |
| dc.type | text |