General Error Locator Polynomials for Binary Cyclic Codes With and

In this paper, we show that a recently proposed algorithm for decoding cyclic codes may be applied efficiently to all binary cyclic codes with tles2 and n<63. This is accomplished by providing structure theorems for the codes in this range and classifying the relevant cases

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 53; no. 3
Main Authors Emmanuela Orsini, Emmanuela Orsini, Massimiliano Sala, Massimiliano Sala
Format Journal Article
LanguageEnglish
Published 01.01.2007
Subjects
Algorithms
Classification
Decoding
Errors
Information theory
Locators
Theorems
Online AccessGet full text

Cover

More Information
Summary:In this paper, we show that a recently proposed algorithm for decoding cyclic codes may be applied efficiently to all binary cyclic codes with tles2 and n<63. This is accomplished by providing structure theorems for the codes in this range and classifying the relevant cases
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
content type line 23
ObjectType-Feature-1
ISSN:0018-9448
DOI:10.1109/TIT.2006.889465