Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codes

Author

Villalba, Luis Javier García ; Cortez, José René Fuentes ; Orozco, Ana Lucila Sandoval ; Blaum, Mario

Author_Institution

Dept. of Software Eng. & Artificial Intell. (DISIA), Univ. Complutense de Madrid (UCM), Madrid, Spain

fYear

2011

fDate

July 31 2011-Aug. 5 2011

Firstpage

1186

Lastpage

1189

Abstract

In a previous work [5] it was shown that the best measure for the efficiency of a single burst-correcting code is obtained using the Gallager bound as opposed to the Reiger bound. In this paper, an algorithm that optimizes the search for the best (shortened) cyclic burst-correcting codes is presented. The use of Gray codes in the algorithm optimizes the search, in the sense that no repeated syndromes are computed.

Keywords

Gray codes; block codes; cyclic codes; error correction codes; linear codes; Gallager bound; Gray code; Reiger bound; cyclic single burst-correcting code; linear burst-correcting block code; search optimization; Block codes; Computers; Generators; Polynomials; Reflective binary codes; Systematics; Error-correcting codes; Gallager bound; all-around (AA) bursts; burst errors; cyclic bursts; cyclic codes; guard space; optimal burst-correcting codes; shortened cyclic codes; single burst-correcting codes; wrap-around bursts;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Conference_Location

St. Petersburg

ISSN

2157-8095

Print_ISBN

978-1-4577-0596-0

Electronic_ISBN

2157-8095

Type

conf

DOI

10.1109/ISIT.2011.6033720

Filename

6033720