Transcription of Linear Codes - Michigan State University
{{id}} {{{paragraph}}}
Chapter 3 Linear CodesIn order to define Codes that we can encode and decode efficiently, we add morestructure to the codespace. We shall be mainly interested in Linear Codes . Alinear codeof lengthnover the fieldFis a subspace ofFn. Thus the words oflinear codethe codespaceFnare vectors, and we often refer to codewords the first section we develop the basics of Linear Codes , in particular weintroduce the crucial concept of the dual of a code . The second and third sectionsthen discuss the general principles behind encoding and decoding Linear encounter the important concept of a BasicsIfCis a Linear code that, as a vector space over the fieldF, has dimensionk,then we say thatCis an [n,k] Linear codeoverF, or an [n,k] code , for short.[n, k] Linear codeThere is no conflict with our definition of the dimension ofCas a code , since|C|=|F|k. (Indeed the choice of general terminology was motivated by thespecial case of Linear Codes .) In particular the rate of an [n,k] Linear code isk/n.
The matrix Gis a spanning matrix for the linear code C provided C = spanning matrix RS(G), the row space of G. A generator matrix of the [n;k] linear code Cover generator matrix Fis a k nmatrix Gwith C= RS(G). Thus a generator matrix is a spanning matrix whose rows are linearly independent. We may easily construct many codes using generator ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}