Absract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1971 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
(1971). Linear codes. In: Coding Theory. Lecture Notes in Mathematics, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36657-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-36657-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06363-6
Online ISBN: 978-3-540-36657-7
eBook Packages: Springer Book Archive