Portal de Periódicos da CAPES

Some decoding applications of minimal realization

1995; Springer Science+Business Media; Linguagem: Inglês

10.1007/3-540-60693-9_8

1611-3349

Graham H. Norton,

Cellular Automata and Applications

We show that minimal realization (MR) of a finite sequence and the associated MR algorithm [10] provide new solutions to a number of decoding problems: BCH and Reed-Solomon codes, errors and erasures, classical Goppa codes and negacyclic codes. We concentrate on the MR of the DFT of an error polynomial, thus avoiding the “key equation” and Forney's procedure. We also discuss simplification of the theory in characteristic two and an extension of the MR theory to several sequences, obtaining a new simultaneous MR algorithm.