Abstract
In this chapter we assume that information is coded using an alphabet Q with q distinct symbols. A code is called a block code if the coded information can be divided into blocks of n symbols which can be decoded independently. These blocks are the codewords and n is called the block length or word length (or just length). The examples in Chapter 2 were all block codes. In Chapter 13 we shall briefly discuss a completely different system, called convolutional coding, where an infinite sequence of information symbols i 0, i 1, i2,… is coded into an infinite sequence of message symbols. For example, for rate \( \frac{1}{2} \) one could have i 0, i 1, i 2,… → i 0, i’ 0, i 1, i’ 1,…, where i’ n is a function of i 0, i 1,…, i n . For block codes we generalize (2.1.3) to arbitrary alphabets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
van Lint, J.H. (1999). Linear Codes. In: Introduction to Coding Theory. Graduate Texts in Mathematics, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58575-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-58575-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63653-0
Online ISBN: 978-3-642-58575-3
eBook Packages: Springer Book Archive