Extended Kasami algorithm for cyclic codes

This paper describes a new block code decoding algorithm which is an extension of Kasami decoding and is accordingly named the extended Kasami algorithm. This algorithm is shown to be attractive for linear cyclic block codes of rates ranging from 1/t to 2/t because of the low decoding complexity and consistency of decoding time regardless of the value of E_b/N₀. The algorithm is comparable with another algorithm known as minimum weight decoding (MWD), but is of lower complexity at low values of E_b/N₀. The paper also describes a non-mathematical approach to determination of the best cover positions and suggests possible soft decision schemes