In this paper, we show that a recently proposed algo- rithm for decoding cyclic codes may be applied efficiently to all bi- nary cyclic codes with t <= 2 and n < 63. This is accomplished by providing structure theorems for the codes in this range and clas- sifying the relevant cases.
General error locator polynomials for binary cyclic codes with t <2 and n < 63
Sala, Massimiliano
2007-01-01
Abstract
In this paper, we show that a recently proposed algo- rithm for decoding cyclic codes may be applied efficiently to all bi- nary cyclic codes with t <= 2 and n < 63. This is accomplished by providing structure theorems for the codes in this range and clas- sifying the relevant cases.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
