Some decoding applications of minimal realization

  • Graham Norton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1025)


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.


Cyclic Code Minimal Polynomial Weight Enumerator Minimal Realization Goppa Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berlekamp, E.R. (1968). Algebraic Coding Theory. Mc-Graw Hill, New York.Google Scholar
  2. 2.
    Berlekamp, E.R. (1973) Goppa Codes. IEEE Trans. Information Theory 19, 590–592.CrossRefGoogle Scholar
  3. 3.
    Ding, C., Xiao, G., Shan, W. (1991). The stability theory of stream ciphers. Springer Lecture Notes in Computer Science 561.Google Scholar
  4. 4.
    Feng, G.L., Rao, T.R.N. (1993) Decoding algebraic-geometric codes up to designed minimum distance. IEEE Trans. Information Theory 39, 37–45.CrossRefGoogle Scholar
  5. 5.
    Feng, G.L. and Tzeng, K.K. (1991). A generalization of the Berlekamp-Massey algorithm for multisequence shift register sequence synthesis with applications to decoding cyclic codes. IEEE Trans. Information Theory 37, 1274–1287.CrossRefGoogle Scholar
  6. 6.
    Massey, J.L. (1969). Shift register synthesis and BCH decoding. IEEE Trans. Information Theory 15, 122–127.CrossRefGoogle Scholar
  7. 7.
    McEliece, R. (1977). The Theory of Information and Coding (Encyclopedia of Mathematics and its Applications 3). Addison-Wesley, Reading, Mass.Google Scholar
  8. 8.
    Norton, G.H. (1994). On the minimal realizations of a finite sequence. (Extended Abstract). Eurocodes '94 (Côte d'Or, October 1994), 203–208.Google Scholar
  9. 9.
    Norton, G.H. (1995). On n-dimensional sequences. I. J. Symbolic Computation. In press.Google Scholar
  10. 10.
    Norton, G.H. (1995). On the minimal realizations of a finite sequence. J. Symbolic Computation. In press.Google Scholar
  11. 11.
    Patterson, N.J. (1975). The algebraic decoding of Goppa codes. IEEE Trans. IT 21, 203–207.Google Scholar
  12. 12.
    Truong, T.K., Eastman, W.L., Reed, I.S., Hsu, I.S. (1988). Simplified procedure for correcting both errors and erasures of Reed-Solomon code using Euclidean algorithm. IEE Proceedings 135, 318–324.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Graham Norton
    • 1
  1. 1.Centre for Communications ResearchUniversity of BristolEngland

Personalised recommendations