Advertisement

Linear complexity in coding theory

  • James L. Massey
  • Thomas Schaub
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 311)

Abstract

The linear complexity of sequences is defined and its main properties reviewed. The linear complexity of periodic sequences is examined in detail and an extensive list of its properties is formulated. The discrete Fourier transform (DFT) of a finite sequence is then connected to the linear complexity of a periodic sequence by Blahut's theorem. Cyclic codes are given a DFT formulation that relates their minimum distance to the least linear complexity among certain periodic sequences. To illustrate the power of this approach, a slight generalization of the Hartmann-Tzeng lower bound on minimum distance is proved, as well as the Bose-Chaudhuri-Hocquenghem lower bound. Other applications of linear complexity in the theory of cyclic codes are indicated.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.L. Massey, "Shift-Register Synthesis and BCH Decoding", IEEE Trans. Info.Th., vol. IT-15, pp. 122–127, Jan. 1969.Google Scholar
  2. [2]
    R. Rueppel, "Linear Complexity and Random Sequences", in Advances in Cryptology — EUROCRYPT 85, (Ed. F. Pichler), Lect. Notes in Comp. Sci. No. 219. Heidelberg and New York: Springer, 1986, pp. 167–188.Google Scholar
  3. [3]
    R. Rueppel, Analysis and Design of Stream Ciphers. Heidelberg and New York: Springer, 1986.Google Scholar
  4. [4]
    S.W. Golomb, Shift Register Sequences. San Francisco: Holden-Day, 1967.Google Scholar
  5. [5]
    R.E. Blahut, "Transform Techniques for Error-Control Codes", IBM J. Res. Devel., vol. 23, pp. 299–315, 1979.Google Scholar
  6. [6]
    R.E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.Google Scholar
  7. [7]
    C.R.P. Hartmann and K.K. Tzeng, "Generalizations of the BCH Bound", Info. and Control, vol. 20, pp. 489–498, 1972.Google Scholar
  8. [8]
    J.H. van Lint and R.M. Wilson, "On the Minimum Distance of Cyclic Codes", IEEE Trans. Info. Th., vol. IT-32, pp. 23–40, Jan. 1986.Google Scholar
  9. [9]
    H.J. Matt and J.L. Massey, "Determining the Burst-Correcting Limit of Cyclic Codes", IEEE Trans. Info. Th., vol. IT-26, pp. 289–297, May 1980.Google Scholar
  10. [10]
    T. Kasami, "Comments on ‘Determining the Burst-Correcting Limit of Cyclic Codes'", IEEE Trans. Info. Th., vol. IT-27, p. 812, Nov. 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • James L. Massey
    • 1
  • Thomas Schaub
    • 2
  1. 1.Institute for Signal and Information ProcessingSwiss Federal Institute of TechnologyZurichSwitzerland
  2. 2.Central LaboratoryLandis & GyrZugSwitzerland

Personalised recommendations