Skip to main content

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 188))

  • 105 Accesses

Abstract

To make codes easier to use and to analyze we must impose some algebraic structure on them. The simplest assumption is that the code is linear. In this chapter we give the basic theory of linear codes, including the fundamental notions of generator matrix, parity check matrix, dual code, and standard decoding array.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berlekamp, E.R., (1970) Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by Hadamard smearing, BSTJ 49: 969–986.

    MATH  MathSciNet  Google Scholar 

  2. Berlekamp, E.R. and L.R. Welch (1972), Weight distributions of the cosets of the (32,6) Reed-Müller code, PGIT 18: 203–207.

    MATH  MathSciNet  Google Scholar 

  3. Chien, R.T., and W.D. Frazer (1966), An application of coding theory to document retrieval, PGIT 12: 92–96.

    Google Scholar 

  4. Gulati, B.R. (1972), More about maximal (n,r)-sets, IC 20: 188–191.

    MATH  MathSciNet  Google Scholar 

  5. Hobbs, C.F. (1965), Approximating the performance of a binary group code, PGIT 11: 142–144.

    Google Scholar 

  6. MacWilliams, F.J., N.J.A. Sloane, and J.M. Goethals (1972), The MacWilliams identities for nonlinear codes, BSTJ 51: 803–819.

    MATH  MathSciNet  Google Scholar 

  7. Mac Williams, F.J., N.J.A. Sloane and J.G. Thompson (1972), Good self dual codes exist, DM 3: 153–162.

    MATH  MathSciNet  Google Scholar 

  8. Slepian, D. (1960), Some further theory of group codes, BSTJ 39: 1219–1252.

    MathSciNet  Google Scholar 

  9. Slepian, D. (1968), Group codes for the Gaussian channel, BSTJ 47: 575–602.

    MATH  MathSciNet  Google Scholar 

  10. Sloane, N.J.A. and R.J. Dick (1971), On the enumeration of cosets of first order Reed-Müller codes, IEEE Intern, Conf. on Commun., Montreal 1971, 7: 36–2 to 36–6.

    Google Scholar 

  11. Wyner, A.D. (1965A), Capabilities of bounded discrepancy decoding, BSTJ 44: 1061–1122.

    Google Scholar 

  12. Wyner, A.D. (1969), On coding and information theory, SIAMR 11: 317–346.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Wien

About this chapter

Cite this chapter

Sloane, N.J.A. (1975). Linear Codes. In: A Short Course on Error Correcting Codes. International Centre for Mechanical Sciences, vol 188. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2864-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2864-0_2

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81303-4

  • Online ISBN: 978-3-7091-2864-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics