This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1991, 2008. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied, with or without permission from the author. However, this document may not be kept on any information storage and retrieval system without permission from the author, unless such system is not accessible to any individuals other than its owners. Chapter 11 MATRIX CODES AND POLYNOMIAL CODES 11.1. Introduction In this section, we investigate how elementary group theory enables us to study coding theory more easily. Throughout this section, we assume that m,n N with n > m . Definition. Suppose that : Z m 2 Z n 2 is an encoding function. Then we say that C = ( Z m 2 ) is a group code if C forms a group under coordinatewise addition modulo 2 in Z n 2 . We denote by 0 the identity element of the group Z n 2 . Clearly 0 is the string of n 0s in Z n 2 . PROPOSITION 11A. Suppose that : Z m 2 Z n 2 is an encoding function, and that C = ( Z m 2 ) is a group code. Then min { ( x,y ) : x,y C and x 6 = y } = min { ( x ) : x C and x 6 = 0 } ; in other words, the minimum distance between strings in C is equal to the minimum weight of nonzero strings in C . Proof. Suppose that a,b,c C satisfy ( a,b ) = min { ( x,y ) : x,y C and x 6 = y } and ( c ) = min { ( x ) : x C and x 6 = 0 } . We shall prove that ( a,b ) = ( c ) by showing that (a) ( a,b ) ( c ); and (b) ( a,b ) ( c ). (a) Since C is a group, the identity element 0 C . It follows that ( c ) = ( c, 0) { ( x,y ) : x,y C and x 6 = y } , so ( c ) ( a,b ). Chapter 11 : Matrix Codes and Polynomial Codes page 1 of 12 Discrete Mathematics c W W L Chen, 1991, 2008 (b) Note that ( a,b ) = ( a + b ), and that a + b C since C is a group and a,b C . Hence ( a,b ) = ( a + b ) { ( x ) : x C and x 6 = 0 } , so ( a,b ) ( c ). Note that in view of Proposition 11A, we need at most ( C 1) calculations in order to calculate the minimum distance between code words in C , compared to ( C 2 ) calculations. It is therefore clearly of benefit to ensure that C is a group. This can be achieved with relative ease if we recall Proposition 9E which we restate below in a slightly different form. PROPOSITION 11B. Suppose that : Z m 2 Z n 2 is an encoding function. Then the code C = ( Z m 2 ) is a group code if : Z m 2 Z n 2 is a group homomorphism. 11.2. Matrix Codes An Example Consider an encoding function : Z 3 2 Z 6 2 , given for each string w Z 3 2 by ( w ) = w G , where w is considered as a row vector and where G = 1 0 0 1 1 0 0 1 0 0 1 1 0 0 1 1 0 1 . (1) Since Z 3 2 = { 000 , 001 , 010 , 011 , 100 , 101 , 110 , 111 } , it follows that C = ( Z 3 2 ) = { 000000 , 001101 , 010011 , 011110 , 100110 , 101011...
View Full
Document
 Spring '08
 RAMASWAMY
 Math

Click to edit the document details