Arrangements, matroids and codes
|
|
- Sheryl Hardy
- 5 years ago
- Views:
Transcription
1 Arrangements, matroids and codes first lecture Ruud Pellikaan joint work with Relinde Jurrius ACAGM summer school Leuven Belgium, 18 July 2011
2 References 2/43 1. Codes, arrangements and matroids by Relinde Jurrius and Ruud Pellikaan, in Series on Coding Theory and Cryptology vol. 8 Algebraic geometry modelling in information theory E. Martinez-Moro Ed., World Scientific ruudp/paper/57.pdf 2. Error-correcting codes and cryptology by R. Pellikaan, X.-W. Wu and S. Bulygin Book in preparation, February 2011 To be published by Cambridge University Press ruudp/courses/2wc11/2wc11-book.pdf
3 Introduction 3/43 M A C C = error-correcting codes (extended) weight enumerator polynomial W C (X, Y), W C (X, Y, T) M = matroids generalization of linear algebra and graph theory (di)chromatic polynomial and Tutte polynomial t M (X, Y) A = arrangements of hyperplanes topology, combinatorics characteristic polynomial χ(t), coboundary polynomial χ(s, T)
4 Content 5 lectures 4/43 1. Error-correcting codes Weight enumerator 2. q-ary symmetric channel and the probability of undetected error Arrangements and projective systems 3. Extended weight enumerator Graph theory and colorings 4. Matroids Tutte-Whitney polynomial 5. Geometric lattices Characteristic polynomial
5 Content first lecture 5/43 1. Error-correcting codes: Shannon, Hamming distance 2. Linear codes: Generator and parity check matrix, inner product and dual code Hamming and simplex codes 3. Singleton bound and MDS codes: Vandermonde matrices and generalized Reed-Solomon codes 4. Weight enumerator: MacWilliams identity and examples 5. Exercises
6 6/43 Error-correcting codes
7 Shannon s block diagram 7/43 message sender source encoding receiver message target decoding noise Shannon s block diagram of a communication system
8 Hamming code 8/43 4 message bits: (m 1, m 2, m 3, m 4 ) 3 redundant bits: (r 1, r 2, r 3 ) Rule: number of ones in every circle is even r 3 m 2 m 1 m 4 r 1 m 3 r 2 Venn diagram of the Hamming code
9 Block codes 9/43 The message words have a fixed length of k symbols the encoded words have a fixed length of n symbols both from the same alphabet Q Add redundant symbols to the message in a clever way An error-correcting code C of length n over Q is a non-empty subset of Q n The elements of C are called codewords If C contains M codewords, then M is called the size n log q (M) is called the redundancy R = log q (M)/n is the information rate
10 Block codes 9/43 The message words have a fixed length of k symbols the encoded words have a fixed length of n symbols both from the same alphabet Q Add redundant symbols to the message in a clever way An error-correcting code C of length n over Q is a non-empty subset of Q n The elements of C are called codewords If C contains M codewords, then M is called the size n log q (M) is called the redundancy R = log q (M)/n is the information rate
11 Block codes 9/43 The message words have a fixed length of k symbols the encoded words have a fixed length of n symbols both from the same alphabet Q Add redundant symbols to the message in a clever way An error-correcting code C of length n over Q is a non-empty subset of Q n The elements of C are called codewords If C contains M codewords, then M is called the size n log q (M) is called the redundancy R = log q (M)/n is the information rate
12 Hamming distance 10/43 The Hamming distance d(x, y) on Q n is defined by d(x, y) = {i : x i = y i } It is a metric: 1. d(x, y) 0 and equality hods if and only if x = y 2. d(x, y) = d(y, x) (symmetry) 3. d(x, z) d(x, y) + d(y, z) (triangle inequality) x y d(y,z) d(x,y) z d(x,z)
13 Hamming distance 10/43 The Hamming distance d(x, y) on Q n is defined by d(x, y) = {i : x i = y i } It is a metric: 1. d(x, y) 0 and equality hods if and only if x = y 2. d(x, y) = d(y, x) (symmetry) 3. d(x, z) d(x, y) + d(y, z) (triangle inequality) x y d(y,z) d(x,y) z d(x,z)
14 Minimum distance 11/43 The minimum (Hamming) distance of a code C is defined as d = d(c) = min{d(x, y) : x, y C, x = y} The main problem of error-correcting codes from Hamming s point of view is: to construct for a given length and number of codewords a code with the largest possible minimum distance and to find efficient encoding and decoding algorithms
15 Minimum distance 11/43 The minimum (Hamming) distance of a code C is defined as d = d(c) = min{d(x, y) : x, y C, x = y} The main problem of error-correcting codes from Hamming s point of view is: to construct for a given length and number of codewords a code with the largest possible minimum distance and to find efficient encoding and decoding algorithms
16 Examples 12/43 The triple repetition binary code has length 3 and 2 codewords its information rate is 1/3 its minimum distance is 3. The binary Hamming code has length 7 and 2 4 codewords therefore its rate is 4/7 its minimum distance is 3
17 13/43 Linear codes
18 Linear codes 14/43 If the alphabet Q is the finite field F q with q elements then Q n is a vector space Therefore it is natural to look at codes in Q n that are linear subspaces A linear code C is a linear subspace of F n q Its dimension is denoted by k = k(c) and its minimum distance by d = d(c) Then [n, k, d] q or [n, k, d] denote the parameters of the code Size: M = q k Information rate: R = k/n Redundancy: n k
19 Support and minimal weight 15/43 The support of x in F n q is defined by supp(x) = {j : x j = 0} The weight of x is defined by wt(x) = supp(x) that is the number of nonzero entries of x Let C be an F q -linear code, then d(c) = min{wt(c) : 0 = c C}
20 Support and minimal weight 15/43 The support of x in F n q is defined by supp(x) = {j : x j = 0} The weight of x is defined by wt(x) = supp(x) that is the number of nonzero entries of x Let C be an F q -linear code, then d(c) = min{wt(c) : 0 = c C}
21 Generator and parity check matrix 16/43 C an F q -linear code of dimension k A k n matrix G with entries in F q is called generator matrix of C if C = { xg x F k q } A (n k) n matrix H with entries in F q is called a parity check matrix of C if C = { c F n q ch T = 0 }
22 Generator and parity check matrix 16/43 C an F q -linear code of dimension k A k n matrix G with entries in F q is called generator matrix of C if C = { xg x F k q } A (n k) n matrix H with entries in F q is called a parity check matrix of C if C = { c F n q ch T = 0 }
23 Example 17/43 The binary Hamming code with parameters [7, 4, 3] has generator matrix G: G = and parity check matrix H: H =
24 Example 17/43 The binary Hamming code with parameters [7, 4, 3] has generator matrix G: G = and parity check matrix H: H =
25 Proposition 18/43 Suppose C is a [n, k] code Let I k be the k k identity matrix Let P be a k (n k) matrix Then (I k P) is a generator matrix of C if and only if ( P T I n k ) is a parity check matrix of C
26 Proposition 18/43 Suppose C is a [n, k] code Let I k be the k k identity matrix Let P be a k (n k) matrix Then (I k P) is a generator matrix of C if and only if ( P T I n k ) is a parity check matrix of C
27 Inner product and dual code 19/43 The inner product on F n q is defined by x y = x 1 y x n y n This inner product is bilinear, symmetric and nondegenerate but the notion of positive definite makes no sense over a finite field For an [n, k] code C we define the dual or orthogonal code C as C = {x F n q : c x = 0 for all c C}.
28 Inner product and dual code 19/43 The inner product on F n q is defined by x y = x 1 y x n y n This inner product is bilinear, symmetric and nondegenerate but the notion of positive definite makes no sense over a finite field For an [n, k] code C we define the dual or orthogonal code C as C = {x F n q : c x = 0 for all c C}.
29 Generator and parity check matrix of dual code 20/43 Proposition If C has length n, then dim(c) + dim(c ) = n Furthermore G is a generator matrix of C if and only if G is a parity check matrix of C H is a parity check matrix of C if and only if H is a generator matrix of C
30 Generator and parity check matrix of dual code 20/43 Proposition If C has length n, then dim(c) + dim(c ) = n Furthermore G is a generator matrix of C if and only if G is a parity check matrix of C H is a parity check matrix of C if and only if H is a generator matrix of C
31 Parity check matrix and minimum distance 21/43 Proposition Let H be a parity check matrix of a code C Then the minimum distance d of C is the smallest integer d such that d columns of H are linearly dependent Proof H parity check matrix with entries h i,j c a codeword of weight d with nonzero entries c ji Hc T = 0 c j1 c jd h 1,j1 h 1,jd.. h (n k),j1 h (n k),jd
32 Parity check matrix and minimum distance 21/43 Proposition Let H be a parity check matrix of a code C Then the minimum distance d of C is the smallest integer d such that d columns of H are linearly dependent Proof H parity check matrix with entries h i,j c a codeword of weight d with nonzero entries c ji Hc T = 0 c j1 c jd h 1,j1 h 1,jd.. h (n k),j1 h (n k),jd
33 Nondegenerate codes 22/43 Let G be a generator matrix of C C is called nondegenerate if for every position j there is codeword c such that c j = 0 The following statements are equivalent: 1. C is nondegenerate 2. G has no zero column 3. d(c ) 2
34 Nondegenerate codes 22/43 Let G be a generator matrix of C C is called nondegenerate if for every position j there is codeword c such that c j = 0 The following statements are equivalent: 1. C is nondegenerate 2. G has no zero column 3. d(c ) 2
35 q-ary Hamming and simplex codes 23/43 Let n = (q r 1)/(q 1) Let H r (q) be a r n matrix over F q such that no two columns are dependent The code H r (q) with H r (q) as parity check matrix is called a q-ary Hamming code The code with H r (q) as generator matrix is called a q-ary simplex code and is denoted by S r (q) S r (q) and H r (q) are dual codes
36 q-ary Hamming and simplex codes 23/43 Let n = (q r 1)/(q 1) Let H r (q) be a r n matrix over F q such that no two columns are dependent The code H r (q) with H r (q) as parity check matrix is called a q-ary Hamming code The code with H r (q) as generator matrix is called a q-ary simplex code and is denoted by S r (q) S r (q) and H r (q) are dual codes
37 Parameters of Hamming and Simplex codes 24/43 Let r 2 The q-ary Hamming code H r (q) has parameters [(q r 1)/(q 1), (q r 1)/(q 1) r, 3] The q-ary simplex code S r (q) is a constant weight code with parameters [(q r 1)/(q 1), r, q r 1 ]
38 Parameters of Hamming and Simplex codes 24/43 Let r 2 The q-ary Hamming code H r (q) has parameters [(q r 1)/(q 1), (q r 1)/(q 1) r, 3] The q-ary simplex code S r (q) is a constant weight code with parameters [(q r 1)/(q 1), r, q r 1 ]
39 Example S 3 (3) 25/43 Consider the ternary Hamming code S 3 (3) of redundancy 3 of length 13 with parity check matrix H 3 (3) = The code H 3 (3) has parameters [13, 10, 3] The code S 3 (3) has parameters [13, 3, 9] All rows of H 3 (3) have weight 9 In fact all nonzero codewords have weight 9.
40 Example S 3 (3) 25/43 Consider the ternary Hamming code S 3 (3) of redundancy 3 of length 13 with parity check matrix H 3 (3) = The code H 3 (3) has parameters [13, 10, 3] The code S 3 (3) has parameters [13, 3, 9] All rows of H 3 (3) have weight 9 In fact all nonzero codewords have weight 9.
41 26/43 Singleton bound and MDS codes
42 Singleton bound 27/43 Theorem If C is an [n, k, d] code, then d n k + 1 Proof Let H be a parity check matrix of C This is an (n k) n matrix There exist n k + 1 dependent columns in fact every (n k + 1)-tuple of columns is dependent Now d(c) is the smallest integer d such that H has d linearly dependent columns So d n k + 1
43 Singleton bound 27/43 Theorem If C is an [n, k, d] code, then d n k + 1 Proof Let H be a parity check matrix of C This is an (n k) n matrix There exist n k + 1 dependent columns in fact every (n k + 1)-tuple of columns is dependent Now d(c) is the smallest integer d such that H has d linearly dependent columns So d n k + 1
44 MDS codes 28/43 Definition Let C be a [n, k, n k + 1] code Then C is called a maximum distance separable (MDS) code From the Singleton bound, an MDS code achieves the maximum possible value for the minimum distance given its length and dimension Examples The minimum distance of the zero code of length n is n + 1, by definition Hence the zero code has parameters [n, 0, n + 1] and is MDS Its dual is the whole space F n q with parameters [n, n, 1] and is also MDS The n-fold repetition code has parameters [n, 1, n] and its dual is an [n, n 1, 2] code and both are MDS
45 MDS codes 28/43 Definition Let C be a [n, k, n k + 1] code Then C is called a maximum distance separable (MDS) code From the Singleton bound, an MDS code achieves the maximum possible value for the minimum distance given its length and dimension Examples The minimum distance of the zero code of length n is n + 1, by definition Hence the zero code has parameters [n, 0, n + 1] and is MDS Its dual is the whole space F n q with parameters [n, n, 1] and is also MDS The n-fold repetition code has parameters [n, 1, n] and its dual is an [n, n 1, 2] code and both are MDS
46 MDS codes 28/43 Definition Let C be a [n, k, n k + 1] code Then C is called a maximum distance separable (MDS) code From the Singleton bound, an MDS code achieves the maximum possible value for the minimum distance given its length and dimension Examples The minimum distance of the zero code of length n is n + 1, by definition Hence the zero code has parameters [n, 0, n + 1] and is MDS Its dual is the whole space F n q with parameters [n, n, 1] and is also MDS The n-fold repetition code has parameters [n, 1, n] and its dual is an [n, n 1, 2] code and both are MDS
47 Dual of an MDS code 29/43 Proposition Let C be an [n, k, d] code over F q Then the following statements are equivalent: 1. C is an MDS code, 2. every n k columns of a parity check matrix H of C are linearly independent, 3. every k columns of a generator matrix G of C are linearly independent. Corollary The dual of an MDS code is again MDS
48 Dual of an MDS code 29/43 Proposition Let C be an [n, k, d] code over F q Then the following statements are equivalent: 1. C is an MDS code, 2. every n k columns of a parity check matrix H of C are linearly independent, 3. every k columns of a generator matrix G of C are linearly independent. Corollary The dual of an MDS code is again MDS
49 Vandermonde matrices and MDS codes 30/43 Proposition Let n q Let a = (a 1,..., a n ) be an n-tuple of mutually distinct elements of F q Let k be an integer such that 0 k n Define the matrix G k (a) by 1 1 a 1 a n G k (a) =..... a1 k 1 an k 1 The code with generator matrix G k (a) is MDS Proof All k k submatrices are Vandermonde matrices and their determinants are not zero
50 Vandermonde matrices and MDS codes 30/43 Proposition Let n q Let a = (a 1,..., a n ) be an n-tuple of mutually distinct elements of F q Let k be an integer such that 0 k n Define the matrix G k (a) by 1 1 a 1 a n G k (a) =..... a1 k 1 an k 1 The code with generator matrix G k (a) is MDS Proof All k k submatrices are Vandermonde matrices and their determinants are not zero
51 Reed-Solomon codes 31/43 f(x) = f 0 + f 1 X + + f i X i + + f k 1 X k 1 F q [X] a 1 a n f f 1 a 1 a n X f i a1 i an i X i f k 1 a1 k 1 an k 1 f(a 1 ) f(a n ) f(x) X k 1 The linear combination of the rows of G k (a) is equal to the evaluation of f(x) at a 1,..., a n
52 Reed-Solomon codes 31/43 f(x) = f 0 + f 1 X + + f i X i + + f k 1 X k 1 F q [X] a 1 a n f f 1 a 1 a n X f i a1 i an i X i f k 1 a1 k 1 an k 1 f(a 1 ) f(a n ) f(x) X k 1 The linear combination of the rows of G k (a) is equal to the evaluation of f(x) at a 1,..., a n
53 Generalized Reed-Solomon codes 32/43 a = (a 1,..., a n ) an n-tuple of mutually distinct elements of F q b = (b 1,..., b n ) an n-tuple of nonzero elements of F q GRS k (a, b) = { (f(a 1 )b 1,..., f(a n )b n ) f(x) F q [X], deg(f(x)) < k } Generator matrix: G k (a, b) = b 1 b j b n a 1 b 1 a j b j a n b n... a1 k 1 b 1 a k 1 j b j an k 1 b n MDS code with parameters: [n, k, n k + 1] if k n
54 Generalized Reed-Solomon codes 32/43 a = (a 1,..., a n ) an n-tuple of mutually distinct elements of F q b = (b 1,..., b n ) an n-tuple of nonzero elements of F q GRS k (a, b) = { (f(a 1 )b 1,..., f(a n )b n ) f(x) F q [X], deg(f(x)) < k } Generator matrix: G k (a, b) = b 1 b j b n a 1 b 1 a j b j a n b n... a1 k 1 b 1 a k 1 j b j an k 1 b n MDS code with parameters: [n, k, n k + 1] if k n
55 33/43 Weight enumerator
56 Weight enumerator 34/43 Let C be a code of length n The weight spectrum or weight distribution is the set {(w, A w ) : w = 0, 1,..., n} where A w denotes the number of codewords in C of weight w The weight enumerator is the polynomial: W C (Z) = n A w Z w. w=0 The homogeneous weight enumerator is: n W C (X, Y) = A w X n w Y w. w=0
57 Weight enumerator 34/43 Let C be a code of length n The weight spectrum or weight distribution is the set {(w, A w ) : w = 0, 1,..., n} where A w denotes the number of codewords in C of weight w The weight enumerator is the polynomial: W C (Z) = n A w Z w. w=0 The homogeneous weight enumerator is: n W C (X, Y) = A w X n w Y w. w=0
58 Example: trivial codes 35/43 The zero code has one codeword and its weight is zero Hence W {0} (X, Y) = X n The number of words of weight w in the trivial code F n q is So W F n q (X, Y) = n w=0 A w = ( ) n (q 1) w w ( ) n (q 1) w X n w Y w = (X + (q 1)Y) n w
59 Example: trivial codes 35/43 The zero code has one codeword and its weight is zero Hence W {0} (X, Y) = X n The number of words of weight w in the trivial code F n q is So W F n q (X, Y) = n w=0 A w = ( ) n (q 1) w w ( ) n (q 1) w X n w Y w = (X + (q 1)Y) n w
60 Example: repetition and even weight code 36/43 The n-fold repetition code C has homogeneous weight enumerator W C (X, Y) = X n + (q 1)Y n In the binary case its dual is the even weight code Hence it has homogeneous weight enumerator: W C (X, Y) = n/2 t=0 ( ) n X n 2t Y 2t = 1 ( (X + Y) n + (X Y) n) 2t 2
61 Example: repetition and even weight code 36/43 The n-fold repetition code C has homogeneous weight enumerator W C (X, Y) = X n + (q 1)Y n In the binary case its dual is the even weight code Hence it has homogeneous weight enumerator: W C (X, Y) = n/2 t=0 ( ) n X n 2t Y 2t = 1 ( (X + Y) n + (X Y) n) 2t 2
62 Example: [7, 4, 3] binary Hamming code 37/43 The nonzero entries of the weight distribution are A 0 = 1, A 3 = 7, A 4 = 7, A 7 = 1 by inspection of all the 16 codewords Hence its homogeneous weight enumerator is X 7 + 7X 4 Y 3 + 7X 3 Y 4 + Y 7
63 Example: [7, 4, 3] binary Hamming code 37/43 The nonzero entries of the weight distribution are A 0 = 1, A 3 = 7, A 4 = 7, A 7 = 1 by inspection of all the 16 codewords Hence its homogeneous weight enumerator is X 7 + 7X 4 Y 3 + 7X 3 Y 4 + Y 7
64 Example: simplex code S r (q) 38/43 This is a constant weight code with parameters [(q r 1)/(q 1), r, q r 1 ] Hence its homogeneous weight enumerator is W Sr (q)(x, Y) = X n + (q r 1)X n qr 1 Y qr 1
65 Example: simplex code S r (q) 38/43 This is a constant weight code with parameters [(q r 1)/(q 1), r, q r 1 ] Hence its homogeneous weight enumerator is W Sr (q)(x, Y) = X n + (q r 1)X n qr 1 Y qr 1
66 MacWilliams identity 39/43 Theorem Let C be a [n, k] code over F q Then W C (X, Y) = q k W C (X + (q 1)Y, X Y) Proof Several proofs are known One will be given at the end by means of the Tutte polynomial
67 MacWilliams identity 39/43 Theorem Let C be a [n, k] code over F q Then W C (X, Y) = q k W C (X + (q 1)Y, X Y) Proof Several proofs are known One will be given at the end by means of the Tutte polynomial
68 Example: dual repetition code 40/43 The n-fold repetition code C has homogeneous weight enumerator W C (X, Y) = X n + (q 1)Y n Using MacWilliams identity gives the homogeneous weight enumerator of its dual: W C (X, Y) = q 1 W C (X + (q 1)Y, X Y) = q 1 ((X + (q 1)Y) n + (q 1)(X Y) n ) n ( ) n (q 1) w + (q 1)( 1) w = X n w Y w w q w=0
69 Example: dual repetition code 40/43 The n-fold repetition code C has homogeneous weight enumerator W C (X, Y) = X n + (q 1)Y n Using MacWilliams identity gives the homogeneous weight enumerator of its dual: W C (X, Y) = q 1 W C (X + (q 1)Y, X Y) = q 1 ((X + (q 1)Y) n + (q 1)(X Y) n ) n ( ) n (q 1) w + (q 1)( 1) w = X n w Y w w q w=0
70 41/43 Exercises
71 Exercises first lecture 42/43 1. Check MacWilliams identity for the binary [7, 4, 3] Hamming code and its dual the [7, 3, 4] simplex code. 2. Compute the weight enumerators of the ternary Hamming H 3 (3) code and its dual the Simplex S 3 (3) code. Show that MacWilliams identity holds. 3. Compute the weight spectrum of the dual of the q-ary n-fold repetition code directly, without using MacWilliams identity. Compare this result as given in the lecture. 4. Consider the code with generator matrix (I k I k ). Show that its weight enumerator is equal (X 2 + (q 1)Y 2 ) k. Show that the code is self dual if and only if q is even. Verify that this code is formally self-dual, that is the code and its dual have the same weight enumerator.
72 Exercises first lecture 43/43 5. Let C be the code over F q with generator matrix G given by G = Determine the finite fields F q such that the code C contains a word of weight 7?
Application of hyperplane arrangements to weight enumeration
Application of hyperplane arrangements to weight enumeration Relinde Jurrius (joint work with Ruud Pellikaan) Vrije Universiteit Brussel Joint Mathematics Meetings January 15, 2014 Relinde Jurrius (VUB)
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
More information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
More informationThe extended coset leader weight enumerator
The extended coset leader weight enumerator Relinde Jurrius Ruud Pellikaan Eindhoven University of Technology, The Netherlands Symposium on Information Theory in the Benelux, 2009 1/14 Outline Codes, weights
More informationThe coset leader and list weight enumerator
Contemporary Mathematics The coset leader and list weight enumerator Relinde Jurrius and Ruud Pellikaan In Topics in Finite Fields 11th International Conference on Finite Fields and their Applications
More informationOrthogonal Arrays & Codes
Orthogonal Arrays & Codes Orthogonal Arrays - Redux An orthogonal array of strength t, a t-(v,k,λ)-oa, is a λv t x k array of v symbols, such that in any t columns of the array every one of the possible
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Spring 2009 Instructor : Stefaan Delcroix Chapter 1 Introduction to Error-Correcting Codes It happens quite often that a message becomes corrupt
More informationHamming codes and simplex codes ( )
Chapter 6 Hamming codes and simplex codes (2018-03-17) Synopsis. Hamming codes are essentially the first non-trivial family of codes that we shall meet. We start by proving the Distance Theorem for linear
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Fall 2011 Instructor : Stefaan Delcroix Contents 1 Introduction to Error-Correcting Codes 3 2 Basic Concepts and Properties 6 2.1 Definitions....................................
More informationLecture 12: November 6, 2017
Information and Coding Theory Autumn 017 Lecturer: Madhur Tulsiani Lecture 1: November 6, 017 Recall: We were looking at codes of the form C : F k p F n p, where p is prime, k is the message length, and
More informationMATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
More informationCode Based Cryptology at TU/e
Code Based Cryptology at TU/e Ruud Pellikaan g.r.pellikaan@tue.nl University Indonesia, Depok, Nov. 2 University Padjadjaran, Bandung, Nov. 6 Institute Technology Bandung, Bandung, Nov. 6 University Gadjah
More informationLecture 3: Error Correcting Codes
CS 880: Pseudorandomness and Derandomization 1/30/2013 Lecture 3: Error Correcting Codes Instructors: Holger Dell and Dieter van Melkebeek Scribe: Xi Wu In this lecture we review some background on error
More informationVector spaces. EE 387, Notes 8, Handout #12
Vector spaces EE 387, Notes 8, Handout #12 A vector space V of vectors over a field F of scalars is a set with a binary operator + on V and a scalar-vector product satisfying these axioms: 1. (V, +) is
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationError-correcting Pairs for a Public-key Cryptosystem
Error-correcting Pairs for a Public-key Cryptosystem Ruud Pellikaan g.r.pellikaan@tue.nl joint work with Irene Márquez-Corbella Code-based Cryptography Workshop 2012 Lyngby, 9 May 2012 Introduction and
More information: Error Correcting Codes. October 2017 Lecture 1
03683072: Error Correcting Codes. October 2017 Lecture 1 First Definitions and Basic Codes Amnon Ta-Shma and Dean Doron 1 Error Correcting Codes Basics Definition 1. An (n, K, d) q code is a subset of
More informationLecture 2 Linear Codes
Lecture 2 Linear Codes 2.1. Linear Codes From now on we want to identify the alphabet Σ with a finite field F q. For general codes, introduced in the last section, the description is hard. For a code of
More informationError Correcting Codes: Combinatorics, Algorithms and Applications Spring Homework Due Monday March 23, 2009 in class
Error Correcting Codes: Combinatorics, Algorithms and Applications Spring 2009 Homework Due Monday March 23, 2009 in class You can collaborate in groups of up to 3. However, the write-ups must be done
More informationMATH3302. Coding and Cryptography. Coding Theory
MATH3302 Coding and Cryptography Coding Theory 2010 Contents 1 Introduction to coding theory 2 1.1 Introduction.......................................... 2 1.2 Basic definitions and assumptions..............................
More informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationELEC 519A Selected Topics in Digital Communications: Information Theory. Hamming Codes and Bounds on Codes
ELEC 519A Selected Topics in Digital Communications: Information Theory Hamming Codes and Bounds on Codes Single Error Correcting Codes 2 Hamming Codes (7,4,3) Hamming code 1 0 0 0 0 1 1 0 1 0 0 1 0 1
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
More informationMT5821 Advanced Combinatorics
MT5821 Advanced Combinatorics 1 Error-correcting codes In this section of the notes, we have a quick look at coding theory. After a motivating introduction, we discuss the weight enumerator of a code,
More informationCoding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014
Anna Dovzhik 1 Coding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014 Sharing data across channels, such as satellite, television, or compact disc, often
More informationCyclic Redundancy Check Codes
Cyclic Redundancy Check Codes Lectures No. 17 and 18 Dr. Aoife Moloney School of Electronics and Communications Dublin Institute of Technology Overview These lectures will look at the following: Cyclic
More informationFinite Mathematics. Nik Ruškuc and Colva M. Roney-Dougal
Finite Mathematics Nik Ruškuc and Colva M. Roney-Dougal September 19, 2011 Contents 1 Introduction 3 1 About the course............................. 3 2 A review of some algebraic structures.................
More information: Coding Theory. Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, upattane
2301532 : Coding Theory Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, 2006 http://pioneer.chula.ac.th/ upattane Chapter 1 Error detection, correction and decoding 1.1 Basic definitions and
More informationThe BCH Bound. Background. Parity Check Matrix for BCH Code. Minimum Distance of Cyclic Codes
S-723410 BCH and Reed-Solomon Codes 1 S-723410 BCH and Reed-Solomon Codes 3 Background The algebraic structure of linear codes and, in particular, cyclic linear codes, enables efficient encoding and decoding
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
More informationELEC-E7240 Coding Methods L (5 cr)
Introduction ELEC-E7240 Coding Methods L (5 cr) Patric Östergård Department of Communications and Networking Aalto University School of Electrical Engineering Spring 2017 Patric Östergård (Aalto) ELEC-E7240
More informationMATH3302 Coding Theory Problem Set The following ISBN was received with a smudge. What is the missing digit? x9139 9
Problem Set 1 These questions are based on the material in Section 1: Introduction to coding theory. You do not need to submit your answers to any of these questions. 1. The following ISBN was received
More informationError-Correcting Codes
Error-Correcting Codes HMC Algebraic Geometry Final Project Dmitri Skjorshammer December 14, 2010 1 Introduction Transmission of information takes place over noisy signals. This is the case in satellite
More informationMATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet
More informationCoding Theory and Applications. Linear Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Linear Codes Enes Pasalic University of Primorska Koper, 2013 2 Contents 1 Preface 5 2 Shannon theory and coding 7 3 Coding theory 31 4 Decoding of linear codes and MacWilliams
More informationLecture Introduction. 2 Linear codes. CS CTT Current Topics in Theoretical CS Oct 4, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 4, 01 Lecturer: Elena Grigorescu Lecture 14 Scribe: Selvakumaran Vadivelmurugan 1 Introduction We introduced error-correcting codes and linear codes in
More informationReed-Solomon codes. Chapter Linear codes over finite fields
Chapter 8 Reed-Solomon codes In the previous chapter we discussed the properties of finite fields, and showed that there exists an essentially unique finite field F q with q = p m elements for any prime
More informationQuantum LDPC Codes Derived from Combinatorial Objects and Latin Squares
Codes Derived from Combinatorial Objects and s Salah A. Aly & Latin salah at cs.tamu.edu PhD Candidate Department of Computer Science Texas A&M University November 11, 2007 Motivation for Computers computers
More informationICT12 8. Linear codes. The Gilbert-Varshamov lower bound and the MacWilliams identities SXD
1 ICT12 8. Linear codes. The Gilbert-Varshamov lower bound and the MacWilliams identities 19.10.2012 SXD 8.1. The Gilbert Varshamov existence condition 8.2. The MacWilliams identities 2 8.1. The Gilbert
More informationMath 512 Syllabus Spring 2017, LIU Post
Week Class Date Material Math 512 Syllabus Spring 2017, LIU Post 1 1/23 ISBN, error-detecting codes HW: Exercises 1.1, 1.3, 1.5, 1.8, 1.14, 1.15 If x, y satisfy ISBN-10 check, then so does x + y. 2 1/30
More informationAlgebraic Geometry Codes. Shelly Manber. Linear Codes. Algebraic Geometry Codes. Example: Hermitian. Shelly Manber. Codes. Decoding.
Linear December 2, 2011 References Linear Main Source: Stichtenoth, Henning. Function Fields and. Springer, 2009. Other Sources: Høholdt, Lint and Pellikaan. geometry codes. Handbook of Coding Theory,
More information7.1 Definitions and Generator Polynomials
Chapter 7 Cyclic Codes Lecture 21, March 29, 2011 7.1 Definitions and Generator Polynomials Cyclic codes are an important class of linear codes for which the encoding and decoding can be efficiently implemented
More informationSupport weight enumerators and coset weight distributions of isodual codes
Support weight enumerators and coset weight distributions of isodual codes Olgica Milenkovic Department of Electrical and Computer Engineering University of Colorado, Boulder March 31, 2003 Abstract In
More informationChapter 3 Linear Block Codes
Wireless Information Transmission System Lab. Chapter 3 Linear Block Codes Institute of Communications Engineering National Sun Yat-sen University Outlines Introduction to linear block codes Syndrome and
More informationLecture B04 : Linear codes and singleton bound
IITM-CS6845: Theory Toolkit February 1, 2012 Lecture B04 : Linear codes and singleton bound Lecturer: Jayalal Sarma Scribe: T Devanathan We start by proving a generalization of Hamming Bound, which we
More informationAnd for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
More informationLecture 19 : Reed-Muller, Concatenation Codes & Decoding problem
IITM-CS6845: Theory Toolkit February 08, 2012 Lecture 19 : Reed-Muller, Concatenation Codes & Decoding problem Lecturer: Jayalal Sarma Scribe: Dinesh K Theme: Error correcting codes In the previous lecture,
More informationAn Introduction to (Network) Coding Theory
An Introduction to (Network) Coding Theory Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland July 12th, 2018 1 Coding Theory Introduction Reed-Solomon codes 2 Introduction Coherent network
More informationFUNDAMENTALS OF ERROR-CORRECTING CODES - NOTES. Presenting: Wednesday, June 8. Section 1.6 Problem Set: 35, 40, 41, 43
FUNDAMENTALS OF ERROR-CORRECTING CODES - NOTES BRIAN BOCKELMAN Monday, June 6 2005 Presenter: J. Walker. Material: 1.1-1.4 For Lecture: 1,4,5,8 Problem Set: 6, 10, 14, 17, 19. 1. Basic concepts of linear
More information5.0 BCH and Reed-Solomon Codes 5.1 Introduction
5.0 BCH and Reed-Solomon Codes 5.1 Introduction A. Hocquenghem (1959), Codes correcteur d erreurs; Bose and Ray-Chaudhuri (1960), Error Correcting Binary Group Codes; First general family of algebraic
More informationERROR CORRECTING CODES
ERROR CORRECTING CODES To send a message of 0 s and 1 s from my computer on Earth to Mr. Spock s computer on the planet Vulcan we use codes which include redundancy to correct errors. n q Definition. A
More informationLinear Block Codes. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 26 Linear Block Codes Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay July 28, 2014 Binary Block Codes 3 / 26 Let F 2 be the set
More informationSome error-correcting codes and their applications
Chapter 14 Some error-correcting codes and their applications J. D. Key 1 14.1 Introduction In this chapter we describe three types of error-correcting linear codes that have been used in major applications,
More informationA combinatorial view on derived codes
A combinatorial view on derived codes Relinde Jurrius (joint work with Philippe Cara) Vrije Universiteit Brussel, Belgium University of Neuchâtel, Switzerland Finite Geometries September 16, 2014 Relinde
More informationOn Weight Distributions of Homogeneous Metric Spaces Over GF (p m ) and MacWilliams Identity
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 4, Number 2 (2012), pp. 159-164 International Research Publication House http://www.irphouse.com On Weight Distributions
More informationSection 3 Error Correcting Codes (ECC): Fundamentals
Section 3 Error Correcting Codes (ECC): Fundamentals Communication systems and channel models Definition and examples of ECCs Distance For the contents relevant to distance, Lin & Xing s book, Chapter
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationThe (extended) rank weight enumerator and q-matroids
The (extended) rank weight enumerator and q-matroids Relinde Jurrius Ruud Pellikaan Vrije Universiteit Brussel, Belgium Eindhoven University of Technology, The Netherlands Conference on Random network
More informationLecture 4: Linear Codes. Copyright G. Caire 88
Lecture 4: Linear Codes Copyright G. Caire 88 Linear codes over F q We let X = F q for some prime power q. Most important case: q =2(binary codes). Without loss of generality, we may represent the information
More informationCodes over Subfields. Chapter Basics
Chapter 7 Codes over Subfields In Chapter 6 we looked at various general methods for constructing new codes from old codes. Here we concentrate on two more specialized techniques that result from writing
More informationMAS309 Coding theory
MAS309 Coding theory Matthew Fayers January March 2008 This is a set of notes which is supposed to augment your own notes for the Coding Theory course They were written by Matthew Fayers, and very lightly
More informationIntroduction to binary block codes
58 Chapter 6 Introduction to binary block codes In this chapter we begin to study binary signal constellations, which are the Euclidean-space images of binary block codes. Such constellations have nominal
More informationBerlekamp-Massey decoding of RS code
IERG60 Coding for Distributed Storage Systems Lecture - 05//06 Berlekamp-Massey decoding of RS code Lecturer: Kenneth Shum Scribe: Bowen Zhang Berlekamp-Massey algorithm We recall some notations from lecture
More informationLecture notes on coding theory
Lecture notes on coding theory Raymond van Bommel Curves over finite fields, Autumn 2017, Leiden 1 Introduction When one agent tries to transfer information to another agent through a noisy channel, errors
More informationKnow the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].
The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive
More informationA Relation Between Weight Enumerating Function and Number of Full Rank Sub-matrices
A Relation Between Weight Enumerating Function and Number of Full Ran Sub-matrices Mahesh Babu Vaddi and B Sundar Rajan Department of Electrical Communication Engineering, Indian Institute of Science,
More informationarxiv: v4 [cs.it] 14 May 2013
arxiv:1006.1694v4 [cs.it] 14 May 2013 PURE ASYMMETRIC QUANTUM MDS CODES FROM CSS CONSTRUCTION: A COMPLETE CHARACTERIZATION MARTIANUS FREDERIC EZERMAN Centre for Quantum Technologies, National University
More informationCombinatória e Teoria de Códigos Exercises from the notes. Chapter 1
Combinatória e Teoria de Códigos Exercises from the notes Chapter 1 1.1. The following binary word 01111000000?001110000?00110011001010111000000000?01110 encodes a date. The encoding method used consisted
More information1 Vandermonde matrices
ECE 771 Lecture 6 BCH and RS codes: Designer cyclic codes Objective: We will begin with a result from linear algebra regarding Vandermonde matrices This result is used to prove the BCH distance properties,
More informationMathematics Department
Mathematics Department Matthew Pressland Room 7.355 V57 WT 27/8 Advanced Higher Mathematics for INFOTECH Exercise Sheet 2. Let C F 6 3 be the linear code defined by the generator matrix G = 2 2 (a) Find
More informationNon-Standard Coding Theory
Non-Standard Coding Theory Steven T. Dougherty July 3, 2013 Rosenbloom-Tsfasman Metric Codes with the Rosenbloom-Tsfasman Metric Rosenbloom-Tsfasman Metric Mat n,s (F q ) denotes the linear space of all
More informationCodewords of small weight in the (dual) code of points and k-spaces of P G(n, q)
Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),
More informationDecoding linear codes via systems solving: complexity issues
Decoding linear codes via systems solving: complexity issues Stanislav Bulygin (joint work with Ruud Pellikaan) University of Kaiserslautern June 19, 2008 Outline Outline of the talk Introduction: codes
More informationEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Linear Block Codes February 14, 2007 1. Code 1: n = 4, n k = 2 Parity Check Equations: x 1 + x 3 = 0, x 1 + x 2 + x 4 = 0 Parity Bits: x 3 = x 1,
More informationHamming Codes 11/17/04
Hamming Codes 11/17/04 History In the late 1940 s Richard Hamming recognized that the further evolution of computers required greater reliability, in particular the ability to not only detect errors, but
More informationOpen Questions in Coding Theory
Open Questions in Coding Theory Steven T. Dougherty July 4, 2013 Open Questions The following questions were posed by: S.T. Dougherty J.L. Kim P. Solé J. Wood Hilbert Style Problems Hilbert Style Problems
More informationMTH6108 Coding theory
MTH6108 Coding theory Contents 1 Introduction and definitions 2 2 Good codes 6 2.1 The main coding theory problem............................ 6 2.2 The Singleton bound...................................
More informationPAijpam.eu CONVOLUTIONAL CODES DERIVED FROM MELAS CODES
International Journal of Pure and Applied Mathematics Volume 85 No. 6 013, 1001-1008 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v85i6.3
More informationAn Introduction to (Network) Coding Theory
An to (Network) Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland April 24th, 2018 Outline 1 Reed-Solomon Codes 2 Network Gabidulin Codes 3 Summary and Outlook A little bit of history
More informationQuasi-cyclic Low Density Parity Check codes with high girth
Quasi-cyclic Low Density Parity Check codes with high girth, a work with Marta Rossi, Richard Bresnan, Massimilliano Sala Summer Doctoral School 2009 Groebner bases, Geometric codes and Order Domains Dept
More informationAlgebraic Codes for Error Control
little -at- mathcs -dot- holycross -dot- edu Department of Mathematics and Computer Science College of the Holy Cross SACNAS National Conference An Abstract Look at Algebra October 16, 2009 Outline Coding
More informationLecture 14: Hamming and Hadamard Codes
CSCI-B69: A Theorist s Toolkit, Fall 6 Oct 6 Lecture 4: Hamming and Hadamard Codes Lecturer: Yuan Zhou Scribe: Kaiyuan Zhu Recap Recall from the last lecture that error-correcting codes are in fact injective
More informationMatroids/1. I and I 2 ,I 2 > I 1
Matroids 1 Definition A matroid is an abstraction of the notion of linear independence in a vector space. See Oxley [6], Welsh [7] for further information about matroids. A matroid is a pair (E,I ), where
More informationLinear Codes and Syndrome Decoding
Linear Codes and Syndrome Decoding These notes are intended to be used as supplementary reading to Sections 6.7 9 of Grimaldi s Discrete and Combinatorial Mathematics. The proofs of the theorems are left
More informationDuadic Codes over Finite Commutative Rings
The Islamic University of Gaza Faculty of Science Department of Mathematics Duadic Codes over Finite Commutative Rings PRESENTED BY Ikhlas Ibraheem Diab Al-Awar SUPERVISED BY Prof. Mohammed Mahmoud AL-Ashker
More informationERROR-CORRECTING CODES AND LATIN SQUARES
ERROR-CORRECTING CODES AND LATIN SQUARES Ritu Ahuja Department of Mathematics, Khalsa College for Women, Civil Lines, Ludhiana 141001, Punjab, (India) ABSTRACT Data stored and transmitted in digital form
More informationCoding theory: algebraic geometry of linear algebra David R. Kohel
Coding theory: algebraic geometry of linear algebra David R. Kohel 1. Introduction. Let R be a ring whose underlying set we call the alphabet. A linear code C over R is a free R-module V of rank k, an
More informationList Decoding of Reed Solomon Codes
List Decoding of Reed Solomon Codes p. 1/30 List Decoding of Reed Solomon Codes Madhu Sudan MIT CSAIL Background: Reliable Transmission of Information List Decoding of Reed Solomon Codes p. 2/30 List Decoding
More informationLecture 8: Shannon s Noise Models
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 8: Shannon s Noise Models September 14, 2007 Lecturer: Atri Rudra Scribe: Sandipan Kundu& Atri Rudra Till now we have
More informationThe upper bound of general Maximum Distance Separable codes
University of New Brunswick Saint John Faculty of Science, Applied Science, and Engineering Math 4200: Honours Project The upper bound of general Maximum Distance Separable codes Svenja Huntemann Supervisor:
More information6.895 PCP and Hardness of Approximation MIT, Fall Lecture 3: Coding Theory
6895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 3: Coding Theory Lecturer: Dana Moshkovitz Scribe: Michael Forbes and Dana Moshkovitz 1 Motivation In the course we will make heavy use of
More informationThe extended Golay code
The extended Golay code N. E. Straathof July 6, 2014 Master thesis Mathematics Supervisor: Dr R. R. J. Bocklandt Korteweg-de Vries Instituut voor Wiskunde Faculteit der Natuurwetenschappen, Wiskunde en
More informationQuadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.
Quadratic forms 1. Symmetric matrices An n n matrix (a ij ) n ij=1 with entries on R is called symmetric if A T, that is, if a ij = a ji for all 1 i, j n. We denote by S n (R) the set of all n n symmetric
More informationChapter 2. Error Correcting Codes. 2.1 Basic Notions
Chapter 2 Error Correcting Codes The identification number schemes we discussed in the previous chapter give us the ability to determine if an error has been made in recording or transmitting information.
More informationj=1 [We will show that the triangle inequality holds for each p-norm in Chapter 3 Section 6.] The 1-norm is A F = tr(a H A).
Math 344 Lecture #19 3.5 Normed Linear Spaces Definition 3.5.1. A seminorm on a vector space V over F is a map : V R that for all x, y V and for all α F satisfies (i) x 0 (positivity), (ii) αx = α x (scale
More informationBinary codes from rectangular lattice graphs and permutation decoding
Binary codes from rectangular lattice graphs and permutation decoding J. D. Key a,,1 P. Seneviratne a a Department of Mathematical Sciences, Clemson University, Clemson SC 29634, U.S.A. Abstract We examine
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More information11 Minimal Distance and the Parity Check Matrix
MATH32031: Coding Theory Part 12: Hamming Codes 11 Minimal Distance and the Parity Check Matrix Theorem 23 (Distance Theorem for Linear Codes) Let C be an [n, k] F q -code with parity check matrix H. Then
More information