Skip to main content

Linear Codes

  • Chapter
  • 546 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 201)

Abstract

In this chapter we construct codes for a discrete memoryless channel for which the input and output alphabets are a set of q symbols where q is a power of a prime, q = pα. In this case we can identify these alphabets with the elements of GF(q). We are going to construct block codes, i.e. codes in which all code words have the same length n which is called the block length or word length.

Keywords

  • Linear Code
  • Code Word
  • Error Pattern
  • Parity Check Matrix
  • Weight Enumerator

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

Copyright information

© 1971 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

van Lint, J.H. (1971). Linear Codes. In: Coding Theory. Lecture Notes in Mathematics, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-20712-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-20712-3_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05476-4

  • Online ISBN: 978-3-662-20712-3

  • eBook Packages: Springer Book Archive