EE512: Error Control Coding
|
|
- Brandon Conley
- 5 years ago
- Views:
Transcription
1 EE51: Error Control Coding Solution for Assignment on BCH and RS Codes March, To determine the dimension and generator polynomial of all narrow sense binary BCH codes of length n = 31, we have to do coset decompostion of the set {0, 1,,..., 30} mod 31 under multiplication by. It can be verified there would be six cosets each with 5 elements and one coset {0}. In other words x can be factorised as follows: x = (x + 1)M α (x)m α 3(x)M α 5(x)M α 7(x)M α 11(x)M α 15(x), where α is a primitive element of GF (3). The degree of each M(x) is equal to 5. The possible degrees for the generator polynomial for narrow sense BCH code are as follows: (n k) = 5, 10, 15, 0, 5, 30. Therefore, the possible dimensions for the code are as follows: k = 6, 1, 16, 11, 6, 1. The generator polynomial of the (31, 6) BCH code will be g 1 (x) = M α (x), while the generator polynomial of the (31, 1) BCH code will be g (x) = M α (x)m α 3(x) and so on.. Let α be the primitive element of GF (104), and let M α i(x) denote the minimal polynomial of α i. Then required generator polynomials are as follows: (a) t = 1. (b) t =. (c) t = 3. (d) t = 4. g 1 (x) = LCM{M α (x), M α (x)} = M α (x). g (x) = LCM{M α (x), M α (x), M α 3(x), M α 4(x)} = M α (x)m α 3(x). g 3 (x) = LCM{M α (x), M α (x),..., M α 6(x)} = M α (x)m α 3(x)M α 5(x). g 4 (x) = LCM{M α (x), M α (x),..., M α 8(x)} = M α (x)m α 3(x)M α 5(x)M α 7(x). 3. To find the dimensions of length-65 narrow sense binary BCH codes of given designed distance δ, it is sufficient to do the coset decomposition of the set {0, 1,, 3,...64} mod 65 under multiplication by. The cosets are as follows: C 0 = {0}, C 1 = {1,, 4, 8, 16, 3, 64, 63, 61, 57, 49, 33}, C 3 = {3, 6, 1, 4, 48, 31, 6, 59, 53, 41, 17, 34}, C 5 = {5, 10, 0, 40, 15, 30, 60, 55, 45, 5, 50, 35}, C 7 = {7, 14, 8, 56, 47, 9, 58, 51, 37, 9, 18, 36}, C 11 = {11,, 44, 3, 46, 7, 54, 43, 1, 4, 19, 38}, C 13 = {13, 6, 5, 39}. Since , GF ( 1 ) will contain an element of order 65. Since ( 1 1) = ( 6 1)( 6 + 1) = 63 65, β = α 63 (α is the primitive element of GF ( 1 )) is an element of order 65. 1
2 (a) δ = 3, t = 1. Therefore, k = 53. (b) δ = 5, t =. Therefore, k = 41. (c) δ = 7, t = 3. Therefore, k = 9. (d) δ = 9, t = 4. (n k) = deg(lcm{m β (x), M β (x)}) = deg(m β (x)) = C 1 = 1. (n k) = deg(lcm{m β (x), M β (x), M β 3(x), M β 4(x)}) = deg(m β (x)m β 3(x)) = C 1 C 3 = 4. (n k) = deg(lcm{m β (x), M β (x),..., M β 6(x)}) = deg(m β (x)m β 3(x)M β 5(x)) = C 1 C 3 C 5 = 36. (n k) = deg(lcm{m β (x), M β (x),..., M β 8(x)}) = deg(m β (x)m β 3(x)M β 5(x)M β 7(x)) = C 1 C 3 C 5 C 7 = 48. Therefore, k = 17. Notice that β 8, β 9 and β 10 are also zeros of this code. Therefore, by the BCH bound, we see that d Decoder for the -error-correcting (31, 1) BCH code. (a) r(x) = x 7 + x 3. Since the received vector r(x) is at a distance from the all-zero codeword, the decoded codeword will be the all-zero vector. Thus, ĉ = 0. (b) r(x) = 1 + x 17 + x 8. The syndromes, s 1 and s 3, are s 1 = r(α) = 1 + α 17 + α 8 = α, and s 3 = r(α 3 ) = 1 + α 0 + α = α 1, where α is a primitive element of GF (3). If X 1 and X are the error locations, then s 1 = α = X 1 + X, s 3 = α 1 = X X 3. From the above, we get X 1 + X = α and X 1 X = α 8. Hence, X 1 and X are roots of the quadratic equation q(x) = x + α x + α 8. No element in GF (3) is a root of q(x). Hence, the bounded-distance secoder fails. (More than errors must have occured) 5. C is a t-error correcting narrow-sense BCH code of length n = m 1. If α is a primitive element of GF ( m ), then {α, α,...α t } are zeros of the code C. Since l = n/(t + 1) and t + 1 = n/l, alpha t+1 is of order l (a primitive l-th root of unity). Therefore, the roots of x l + 1 are 1, α t+1, α (t+1), α 3(t+1),, α (l 1)(t+1), or x l + 1 = (x + 1)(x + α t+1 )(x + α (t+1) ) (x + α (l 1)(t+1) ). Now, since α is a primitive n-th root of unity, Therefore, x n + 1 = (x + 1)(x + α)(x + α ) (x + α n 1 ). a(x) = xn + 1 x l + 1 = (xn l + x n l x l + 1) is a polynomial of degree n 1 with α, α,...α t as zeros. Therefore, a(x) is a codeword of C. Weight of the codeword, a(x) = 1 + x l + x l x tl is t + 1. Therefore, the minimum distance of the code C is equal to t + 1.
3 6. C is a length-n BCH code with {α t,...α 1, 0, α,...α t } as zeros. (a) The number of consecutive zeros is t + 1. By the BCH bound, minimum distance of C is bounded as d min (t + ). (b) If t is odd, t + 1 will be even, and α (t+1) will be included in the conjugate set of α (t+1)/, where α (t+1)/ {α t,...α 1, 0, α,...α t }. Therefore, α (t+1) will also be a zero of C. Similarly, α (t+1) will also be a zero of C. (c) If t is odd, total number of consecutive zeros is (t + 3). Thus, d min (t + 4). 7. The PGZ decoder could be used here. We will present a different solution. The primitive, narrow sense, 3-error correcting (15, 5) BCH code is used over BSC. The received vector [ ] is represented as r(x) = x 5 + x 6 + x 8 + x 1. The generator polynomial of the (15, 5) BCH code is g(x) = 1 + x + x + x 4 + x 5 + x 8 + x 10. Dividing r(x) by g(x), r(x) = (x + 1)g(x) + (x 3 + x + 1). Notice that (x +1)g(x) is a codeword that is a distance 3 away from r(x). Since the codeword has minimum distance 7, the closest codeword is ĉ(x) = r(x)+(x 3 +x+1), or [ ]. How will you generalize this method? Why did this work? To know more, read about error-trapping decoders for cyclic codes. 8. Consider the -error correcting RS code over GF (8). Let α be a primitive element of GF (8). (a) n = 7; (n k) = t = 4 k = 3; Minimum distance, d = t + 1 = 5; Generator polynomial, g(x) = (x + α)(x + α )(x + α 3 )(x + α 4 ), = x 4 + α 3 x 3 + x + αx + α 3. To encode the vector [1 α α ], m(x) = 1 + αx + α x and x (n k) m(x) = x 4 m(x) = x 4 + αx 5 + α x 6. Dividing x 4 m(x) by g(x), x 4 m(x) = g(x)(α x + α 6 x + 1) + (α 6 x 3 + α 5 x + α 4 x + α 3 ). Thus, parity to be appended with the message is given by p(x) = α 6 x 3 + α 5 x + α 4 x + α 3. Finally, the codeword is [α 3 α 4 α 5 α 6 1 α α ]. (b) The binary-expanded code is a (1, 9, 5) code. (c) r(x) = x+αx +α x 3 +α 3 x 4 +x 5. Using the PGZ decoder, it can be verified that the number of errors that occured is, the error locations are 1 and 3, and error magnitudes are α and α 6, respectively. Thus, the error polynomial is e(x) = αx + α 6 x 3, and ĉ(x) = r(x) + e(x) = α 3 x + αx + x 3 + α 3 x 4 + x Consider the -error correcting, narrow-sense, RS code over GF (16). Let α be the primitive element of GF (16). (a) Generator polynomial, g(x) = (x + α)(x + α )(x + α 3 )(x + α 4 ); Check polynomial, h(x) = (x n + 1)/g(x) = (x + α 5 )(x + α 6 )...(x + α 14 ). (b) Parity check metrix H is given by, H = 1 α α... α 14 1 α α 4... α 8 1 α 3 α 6... α 4 1 α 4 α 8... α 56 3
4 (c) The vector [α 6 α 1 α 9 α 1 000α 8 000α 10 αα 13 α] is decoded using the PGZ decoder. It can be verified that the number of errors that occured is 1, error location is 7, and the error magnitude is α 8. Thus the decoded codeword is ĉ = [α 6 α 1 α 9 α α 10 αα 13 α]. 10. In general, an RS code of length n = ( m 1) and error-correcting capability t will have t consecutive zeros, {α l, α (l+1)..., α (l+t 1) }. The generator polynomial is g(x) = (x + α l )(x + α (l+1) )...(x + α (l+t 1) ), and the check polynomial h(x) will have (n t) consecutive roots, namely {α (l+t), α (l+t+1)..., α (l+n 1) }. Therefore, h(x) = (x + α (l+t) )(x + α (l+t+1) )..(x + α (l+n 1) ). Hence, the generator polynomial of the dual code is Thus the roots of g(x) are g(x) = x (n t) h(x 1 ) = (1 + α (l+t) x)(1 + α (l+t+1) x)..(1 + α (l+n 1) x). {α (l+t), α (l+t+1)..., α (l+n 1) }, which is a set of (n t) consecutive roots. Thus, the dual of an RS(n, k, t + 1) code is also an RS code. The dual is an RS(n, t, n t + 1) code. 11. (a) We show that the binary-expanded version of (n = ( m 1), k, d) RS code over GF ( m ) is linear. The binary-expanded version of a RS code consists of the binary expansions of all the codewords of the RS code (expanded using some basis). Since the RS code itself is linear, the binary expanded version will also be linear (Addition in GF ( m ) itself is defined using the vector notation of the elements of GF ( m ) over GF () using a particular basis) (b) Example given in class 1. We show that the ( m 1, k, d) RS code contains the binary BCH code of designed distance d as a subcode. Let α be a primitive element of GF ( m ). The zeros of the ( m 1, k, d) RS code are The generator polynomial of the RS code is Z rs = {α, α,...α d 1 }. g rs (x) = (x + α)(x + α )...(x + α d 1 ). The zeros of the binary BCH code of length n = m 1 and designed distance d are Z bch = C α C α C α d 1}, where C α i denotes all the conjugates of α i. Hence, the generator polynomial of the BCH code is g bch (x) = LCM{M α (x), M α (x),..., M α d 1(x)}, where M α i is the minimal polynomial of α i. Since Z rs Z bch, g rs (x) divides g bch (x) or g bch (x) = a(x)g rs (x). Any codeword of the BCH code can be written as 13. (a) c bch (x) = m(x)g bch (x) = m(x)a(x)g rs (x), which belongs to the RS code. Thus, the binary BCH code is a subcode of the RS code. H = ( ) α α... α α α 4... α 8 Let c = [c 0 c 1 c c 16 ] C, the code over GF(16) with parity-check matrix H, be a nonzero codeword. We will try to find the minimum weight of a nonzero codeword by considering several cases. 4
5 i. case 1: c 0 = c 1 = 0: Then wt(c) =wt([c c 16 ]) and [ ] 1 α α... α 14 1 α α 4... α 8 [c c 16 ] T = 0. Using the BCH bound in the above equation, we see that wt([c c 16 ] 3. wt(c) 3. ii. case : c 0 = 0, c 1 0: Then wt(c) = 1+wt([c c 16 ]) and Hence, (b) [1 α α 14 ][c c 16 ] T = 0. From the above equation, we see that wt([c c 16 ]. Hence, wt(c) 3. iii. case 3: c 0 0, c 1 = 0: Then wt(c) = 1+wt([c c 16 ]) and [1 α α 8 ][c c 16 ] T = 0. From the above equation, we see that wt([c c 16 ]. Hence, wt(c) 3. iv. case 4: c 0 0, c 1 0: Then wt(c) = +wt([c c 16 ]) and [1 α α 14 ][c c 16 ] T 0. From the above equation, we see that wt([c c 16 ] 1. Hence, wt(c) 3. Thus, minimum distance d 3. Since c = [ ] is a valid codeword, d = 3. H = α α... α α α 4... α α 3 α 6... α 4 case (1): Let c = [0 0 0 c 1 ]. From, the given parity check matrix, it is clear that c 1 has to be a codeword of the (15, 1, 4) RS code if c is to belong to the given code. Thus minimum weight possible for such codewords is 4. case (): Let c = [0 0 k c ], where k is some non-zero element of GF(16). From the structure of the given parity check matrix, c (x) has α and α as zeros. Thus, c alone has minimum weight at least 3. Thus the whole vector c has minimum weight = 4. case (3): Let c = [k 0 0 c 3 ]. A similar argument as in case () implies that c 3 (x) has α and α 3 as roots. The minimum weight of the entire vector is = 4. case (4): Let c = [0 k 0 c 4 ]. Here c 4 (x) has α and α 3 as roots. The minimum weight of c 4 (x) can be seen to be 3 using a generalized definition of RS codes over GF( m ). In general, if a cyclic code over GF( m ) has (d 1) equispaced roots, i.e. of the form {α, α (1+r),...α (1+r(d 1) } (r relatively prime to n), rather than (d 1) consecutive roots, the BCH bound still holds. Thus, the whole vector c has minimum weight = 4. Another argument for case (4): Since [ ] 1 α α... α 14 1 α 3 α 6... α 4 c 4 = 0, we see that wt(c 4 ). We will argue by contradiction that wt(c 4 ). Supposing wt(c 4 ) =, we have from the above equation that [ ] α i α j x = 0 α 3i α 3j has a nonzero solution for some i j. But determinant of the matrix in the LHS above is seen to be α i+3j + α j+3i = α i+j (α i + α j ), = α i+j (α i + α j ) 0. 5
6 This results in a contradiction and wt(c 4 ) 3. Thus minimum weight of the entire vector is at least 4. From all the above cases, minimum distance of the given code is at least 4. Since [ ] is a codeword, d = C is a (n = m 1, k, d) RS code with zeros {α, α,...α d 1 }, where α is a primitive element of GF ( m ). Length of Ĉ is clearly m and dimension is k (the same as C, since it contains the same total number of codewords). To prove the minimum distance of the new code is (d+1), it is enough to prove that all minimum weight codewords have a non-zero extended component u n+1. Consider a codeword of C u(x) = m(x)g(x). Suppose u(x) has weight d. Then, u n+1 = u 1 + u u n = u(1) = m(1)g(1), and u n+1 = 0 m(1)g(1) = 0. Since g(1) 0, m(1) = 0. But if m(1) = 0, then m(x) = m 1 (x)(x+ 1), and u(x) = m(x)g(x) = m 1 (x)(x + 1)g(x) u(x) has d consecutive zeros {1, α,, α d 1 }, which implies that u(x) has a minimum weight of (d + 1) resulting in a contradiction. Thus, m(1) 0, Thus u n+1 0 when u(x) has weight d. Thus, the minimum distance of the new extended code is (d + 1). 15. Length of the new code is clearly (n + ). Since the matrix H has column rank (equals row rank) n k (maximum possible), the column rank and row rank of the new parity-check matrix remain n k. Hence, the dimension of the new code is (n + ) (n k) = k +. To prove minimum distance is d, we consider several cases. case (1): Let c = [k 0 c 1 ], where k is a non-zero element of GF ( m ). c 1 has zeros {α, α,...α d }. Thus weight of c 1 (d + 1) = (d 1). Thus the weight of the vector c is at least d. case (): Let c = [0 k c ], where k is a non-zero element of GF ( m ). c has zeros {α, α 3,...α d 1 }. Since the set of zeros form a set of (d ) consecutive roots, weight of c (d + 1) = (d 1), Thus the weight of the vector c is at least d. case (3): Let c = [k 1 k c ], where k 1, k are non-zero elements of GF( m ). c has zeros {α, α 3,...α d }. Since the set of zeros form a set of (d 3) consecutive roots, weight of c (d 3 + 1) = (d ), Thus the weight of the vector c is at least d. case (4): Let c = [0 0 c 3 ]. Then c 3 is a codeword of C and has minimum weight d. Thus the vector c also has weight at least d. From the cases given above, it can be inferred that the minimum weight of the new code is equal to d. 16. Try this on your own using the hints. 6
EE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Cyclic Codes March 22, 2007 1. A cyclic code, C, is an ideal genarated by its minimal degree polynomial, g(x). C = < g(x) >, = {m(x)g(x) : m(x) is
More informationx n k m(x) ) Codewords can be characterized by (and errors detected by): c(x) mod g(x) = 0 c(x)h(x) = 0 mod (x n 1)
Cyclic codes: review EE 387, Notes 15, Handout #26 A cyclic code is a LBC such that every cyclic shift of a codeword is a codeword. A cyclic code has generator polynomial g(x) that is a divisor of every
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 informationECEN 604: Channel Coding for Communications
ECEN 604: Channel Coding for Communications Lecture: Introduction to Cyclic Codes Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 604: Channel Coding for Communications
More informationCoding Theory and Applications. Solved Exercises and Problems of Cyclic Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Solved Exercises and Problems of Cyclic Codes Enes Pasalic University of Primorska Koper, 2013 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a collection of solved
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 informationCyclic codes: overview
Cyclic codes: overview EE 387, Notes 14, Handout #22 A linear block code is cyclic if the cyclic shift of a codeword is a codeword. Cyclic codes have many advantages. Elegant algebraic descriptions: c(x)
More informationInformation Theory. Lecture 7
Information Theory Lecture 7 Finite fields continued: R3 and R7 the field GF(p m ),... Cyclic Codes Intro. to cyclic codes: R8.1 3 Mikael Skoglund, Information Theory 1/17 The Field GF(p m ) π(x) irreducible
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 9B ERROR CONTROL CODING Spring 005 Solutions for Homework 1. (Weights of codewords in a cyclic code) Let g(x) be the generator polynomial of a binary cyclic code of length n. (a) Show that if g(x) has
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 informationLinear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x
Coding Theory Massoud Malek Linear Cyclic Codes Polynomial and Words A polynomial of degree n over IK is a polynomial p(x) = a 0 + a 1 x + + a n 1 x n 1 + a n x n, where the coefficients a 0, a 1, a 2,,
More informationLinear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x f(x) = q(x)h(x) + r(x),
Coding Theory Massoud Malek Linear Cyclic Codes Polynomial and Words A polynomial of degree n over IK is a polynomial p(x) = a 0 + a 1 + + a n 1 x n 1 + a n x n, where the coefficients a 1, a 2,, a n are
More informationB. Cyclic Codes. Primitive polynomials are the generator polynomials of cyclic codes.
B. Cyclic Codes A cyclic code is a linear block code with the further property that a shift of a codeword results in another codeword. These are based on polynomials whose elements are coefficients from
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 informationChapter 6 Reed-Solomon Codes. 6.1 Finite Field Algebra 6.2 Reed-Solomon Codes 6.3 Syndrome Based Decoding 6.4 Curve-Fitting Based Decoding
Chapter 6 Reed-Solomon Codes 6. Finite Field Algebra 6. Reed-Solomon Codes 6.3 Syndrome Based Decoding 6.4 Curve-Fitting Based Decoding 6. Finite Field Algebra Nonbinary codes: message and codeword symbols
More informationCyclic Codes. Saravanan Vijayakumaran August 26, Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Cyclic Codes Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay August 26, 2014 2 / 25 Cyclic Codes Definition A cyclic shift
More informationError Correction Review
Error Correction Review A single overall parity-check equation detects single errors. Hamming codes used m equations to correct one error in 2 m 1 bits. We can use nonbinary equations if we create symbols
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 informationELG 5372 Error Control Coding. Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes
ELG 5372 Error Control Coding Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes Quotient Ring Example + Quotient Ring Example Quotient Ring Recall the quotient ring R={,,, }, where
More informationNew algebraic decoding method for the (41, 21,9) quadratic residue code
New algebraic decoding method for the (41, 21,9) quadratic residue code Mohammed M. Al-Ashker a, Ramez Al.Shorbassi b a Department of Mathematics Islamic University of Gaza, Palestine b Ministry of education,
More informationThe Golay codes. Mario de Boer and Ruud Pellikaan
The Golay codes Mario de Boer and Ruud Pellikaan Appeared in Some tapas of computer algebra (A.M. Cohen, H. Cuypers and H. Sterk eds.), Project 7, The Golay codes, pp. 338-347, Springer, Berlin 1999, after
More informationObjective: To become acquainted with the basic concepts of cyclic codes and some aspects of encoder implementations for them.
ECE 7670 Lecture 5 Cyclic codes Objective: To become acquainted with the basic concepts of cyclic codes and some aspects of encoder implementations for them. Reading: Chapter 5. 1 Cyclic codes Definition
More informationA 2-error Correcting Code
A 2-error Correcting Code Basic Idea We will now try to generalize the idea used in Hamming decoding to obtain a linear code that is 2-error correcting. In the Hamming decoding scheme, the parity check
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationGenerator Matrix. Theorem 6: If the generator polynomial g(x) of C has degree n-k then C is an [n,k]-cyclic code. If g(x) = a 0. a 1 a n k 1.
Cyclic Codes II Generator Matrix We would now like to consider how the ideas we have previously discussed for linear codes are interpreted in this polynomial version of cyclic codes. Theorem 6: If the
More informationCyclic codes. Vahid Meghdadi Reference: Error Correction Coding by Todd K. Moon. February 2008
Cyclic codes Vahid Meghdadi Reference: Error Correction Coding by Todd K. Moon February 2008 1 Definitions Definition 1. A ring < R, +,. > is a set R with two binary operation + (addition) and. (multiplication)
More information: Error Correcting Codes. November 2017 Lecture 2
03683072: Error Correcting Codes. November 2017 Lecture 2 Polynomial Codes and Cyclic Codes Amnon Ta-Shma and Dean Doron 1 Polynomial Codes Fix a finite field F q. For the purpose of constructing polynomial
More informationBinary Primitive BCH Codes. Decoding of the BCH Codes. Implementation of Galois Field Arithmetic. Implementation of Error Correction
BCH Codes Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation of Galois Field Arithmetic Implementation of Error Correction Nonbinary BCH Codes and Reed-Solomon Codes Preface The
More informationG Solution (10 points) Using elementary row operations, we transform the original generator matrix as follows.
EE 387 October 28, 2015 Algebraic Error-Control Codes Homework #4 Solutions Handout #24 1. LBC over GF(5). Let G be a nonsystematic generator matrix for a linear block code over GF(5). 2 4 2 2 4 4 G =
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationChapter 6. BCH Codes
Chapter 6 BCH Codes Description of the Codes Decoding of the BCH Codes Outline Implementation of Galois Field Arithmetic Implementation of Error Correction Nonbinary BCH Codes and Reed-Solomon Codes Weight
More informationNew Algebraic Decoding of (17,9,5) Quadratic Residue Code by using Inverse Free Berlekamp-Massey Algorithm (IFBM)
International Journal of Computational Intelligence Research (IJCIR). ISSN: 097-87 Volume, Number 8 (207), pp. 205 2027 Research India Publications http://www.ripublication.com/ijcir.htm New Algebraic
More informationCodes used in Cryptography
Prasad Krishnan Signal Processing and Communications Research Center, International Institute of Information Technology, Hyderabad March 29, 2016 Outline Coding Theory and Cryptography Linear Codes Codes
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 informationChapter 5. Cyclic Codes
Wireless Information Transmission System Lab. Chapter 5 Cyclic Codes Institute of Communications Engineering National Sun Yat-sen University Outlines Description of Cyclic Codes Generator and Parity-Check
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 informationFault Tolerance & Reliability CDA Chapter 2 Cyclic Polynomial Codes
Fault Tolerance & Reliability CDA 5140 Chapter 2 Cyclic Polynomial Codes - cylic code: special type of parity check code such that every cyclic shift of codeword is a codeword - for example, if (c n-1,
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 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 information} has dimension = k rank A > 0 over F. For any vector b!
FINAL EXAM Math 115B, UCSB, Winter 2009 - SOLUTIONS Due in SH6518 or as an email attachment at 12:00pm, March 16, 2009. You are to work on your own, and may only consult your notes, text and the class
More informationError Detection & Correction
Error Detection & Correction Error detection & correction noisy channels techniques in networking error detection error detection capability retransmition error correction reconstruction checksums redundancy
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 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 informationSection IV.23. Factorizations of Polynomials over a Field
IV.23 Factorizations of Polynomials 1 Section IV.23. Factorizations of Polynomials over a Field Note. Our experience with classical algebra tells us that finding the zeros of a polynomial is equivalent
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 informationCS6304 / Analog and Digital Communication UNIT IV - SOURCE AND ERROR CONTROL CODING PART A 1. What is the use of error control coding? The main use of error control coding is to reduce the overall probability
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 informationMATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions
MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions Basic Questions 1. Give an example of a prime ideal which is not maximal. In the ring Z Z, the ideal {(0,
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 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 informationMarch Algebra 2 Question 1. March Algebra 2 Question 1
March Algebra 2 Question 1 If the statement is always true for the domain, assign that part a 3. If it is sometimes true, assign it a 2. If it is never true, assign it a 1. Your answer for this question
More informationError-correcting codes and Cryptography
Error-correcting codes and Cryptography Henk van Tilborg Code-based Cryptography Workshop Eindhoven, May -2, 2 /45 CONTENTS I II III IV V Error-correcting codes; the basics Quasi-cyclic codes; codes generated
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 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 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 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 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 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 informationOptical Storage Technology. Error Correction
Optical Storage Technology Error Correction Introduction With analog audio, there is no opportunity for error correction. With digital audio, the nature of binary data lends itself to recovery in the event
More informationFinite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together
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 informationImplementation of Galois Field Arithmetic. Nonbinary BCH Codes and Reed-Solomon Codes
BCH Codes Wireless Information Transmission System La. Institute of Communications Engineering g National Sun Yat-sen University Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation
More informationAbstract Algebra: Chapters 16 and 17
Study polynomials, their factorization, and the construction of fields. Chapter 16 Polynomial Rings Notation Let R be a commutative ring. The ring of polynomials over R in the indeterminate x is the set
More information6A The language of polynomials. A Polynomial function follows the rule. Degree of a polynomial is the highest power of x with a non-zero coefficient.
Unit Mathematical Methods Chapter 6: Polynomials Objectives To add, subtract and multiply polynomials. To divide polynomials. To use the remainder theorem, factor theorem and rational-root theorem to identify
More informationOpen problems on cyclic codes
Open problems on cyclic codes Pascale Charpin Contents 1 Introduction 3 2 Different kinds of cyclic codes. 4 2.1 Notation.............................. 5 2.2 Definitions............................. 6
More informationDesign and Implementation of Reed-Solomon Decoder using Decomposed Inversion less Berlekamp-Massey Algorithm by
Design and Implementation of Reed-Solomon Decoder using Decomposed Inversion less Berlekamp-Massey Algorithm by Hazem Abd Elall Ahmed Elsaid A Thesis Submitted to the Faculty of Engineering at Cairo University
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 informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationSelf-Dual Cyclic Codes
Self-Dual Cyclic Codes Bas Heijne November 29, 2007 Definitions Definition Let F be the finite field with two elements and n a positive integer. An [n, k] (block)-code C is a k dimensional linear subspace
More informationAn Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission
An Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission P.Mozhiarasi, C.Gayathri, V.Deepan Master of Engineering, VLSI design, Sri Eshwar College of Engineering, Coimbatore- 641 202,
More informationON PERTURBATION OF BINARY LINEAR CODES. PANKAJ K. DAS and LALIT K. VASHISHT
Math Appl 4 (2015), 91 99 DOI: 1013164/ma201507 ON PERTURBATION OF BINARY LINEAR CODES PANKAJ K DAS and LALIT K VASHISHT Abstract We present new codes by perturbation of rows of the generating matrix of
More informationNarrow-Sense BCH Codes over GF(q) with Length n= qm 1
Narrow-Sense BCH Codes over GFq) with Length n= qm 1 Shuxing Li, Cunsheng Ding, Maosheng Xiong, and Gennian Ge 1 Abstract arxiv:160.07009v [cs.it] 1 Nov 016 Cyclic codes are widely employed in communication
More informationb n x n + b n 1 x n b 1 x + b 0
Math Partial Fractions Stewart 7.4 Integrating basic rational functions. For a function f(x), we have examined several algebraic methods for finding its indefinite integral (antiderivative) F (x) = f(x)
More informationFault Tolerant Computing CS 530 Information redundancy: Coding theory. Yashwant K. Malaiya Colorado State University
CS 530 Information redundancy: Coding theory Yashwant K. Malaiya Colorado State University March 30, 2017 1 Information redundancy: Outline Using a parity bit Codes & code words Hamming distance Error
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 informationSolutions or answers to Final exam in Error Control Coding, October 24, G eqv = ( 1+D, 1+D + D 2)
Solutions or answers to Final exam in Error Control Coding, October, Solution to Problem a) G(D) = ( +D, +D + D ) b) The rate R =/ and ν i = ν = m =. c) Yes, since gcd ( +D, +D + D ) =+D + D D j. d) An
More informationPart III. Cyclic codes
Part III Cyclic codes CHAPTER 3: CYCLIC CODES, CHANNEL CODING, LIST DECODING Cyclic codes are very special linear codes. They are of large interest and importance for several reasons: They posses a rich
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
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 informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationCyclic Codes. Chapter Basics
Chapter 8 Cyclic Codes Among the first codes used practically were the cyclic codes which were generated using shift registers. It was quickly noticed by Prange that the class of cyclic codes has a rich
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 informationMaking Error Correcting Codes Work for Flash Memory
Making Error Correcting Codes Work for Flash Memory Part I: Primer on ECC, basics of BCH and LDPC codes Lara Dolecek Laboratory for Robust Information Systems (LORIS) Center on Development of Emerging
More informationMS 2001: Test 1 B Solutions
MS 2001: Test 1 B Solutions Name: Student Number: Answer all questions. Marks may be lost if necessary work is not clearly shown. Remarks by me in italics and would not be required in a test - J.P. Question
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 informationImplementation of Galois Field Arithmetic. Nonbinary BCH Codes and Reed-Solomon Codes
BCH Codes Wireless Information Transmission System Lab Institute of Communications Engineering g National Sun Yat-sen University Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation
More informationOn Extremal Codes With Automorphisms
On Extremal Codes With Automorphisms Anton Malevich Magdeburg, 20 April 2010 joint work with S. Bouyuklieva and W. Willems 1/ 33 1. Linear codes 2. Self-dual and extremal codes 3. Quadratic residue codes
More informationReed-Solomon Error-correcting Codes
The Deep Hole Problem Matt Keti (Advisor: Professor Daqing Wan) Department of Mathematics University of California, Irvine November 8, 2012 Humble Beginnings Preview of Topics 1 Humble Beginnings Problems
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationMATH/MTHE 406 Homework Assignment 2 due date: October 17, 2016
MATH/MTHE 406 Homework Assignment 2 due date: October 17, 2016 Notation: We will use the notations x 1 x 2 x n and also (x 1, x 2,, x n ) to denote a vector x F n where F is a finite field. 1. [20=6+5+9]
More informationGF(2 m ) arithmetic: summary
GF(2 m ) arithmetic: summary EE 387, Notes 18, Handout #32 Addition/subtraction: bitwise XOR (m gates/ops) Multiplication: bit serial (shift and add) bit parallel (combinational) subfield representation
More informationNew Families of Triple Error Correcting Codes with BCH Parameters
New Families of Triple Error Correcting Codes with BCH Parameters arxiv:0803.3553v1 [cs.it] 25 Mar 2008 Carl Bracken School of Mathematical Sciences University College Dublin Ireland May 30, 2018 Abstract
More information6.1.1 What is channel coding and why do we use it?
Chapter 6 Channel Coding 6.1 Introduction 6.1.1 What is channel coding and why do we use it? Channel coding is the art of adding redundancy to a message in order to make it more robust against noise. It
More informationChapter 6 Lagrange Codes
Chapter 6 Lagrange Codes 6. Introduction Joseph Louis Lagrange was a famous eighteenth century Italian mathematician [] credited with minimum degree polynomial interpolation amongst his many other achievements.
More informationConstruction X for quantum error-correcting codes
Simon Fraser University Burnaby, BC, Canada joint work with Vijaykumar Singh International Workshop on Coding and Cryptography WCC 2013 Bergen, Norway 15 April 2013 Overview Construction X is known from
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationThe number of message symbols encoded into a
L.R.Welch THE ORIGINAL VIEW OF REED-SOLOMON CODES THE ORIGINAL VIEW [Polynomial Codes over Certain Finite Fields, I.S.Reed and G. Solomon, Journal of SIAM, June 1960] Parameters: Let GF(2 n ) be the eld
More informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
More informationRON M. ROTH * GADIEL SEROUSSI **
ENCODING AND DECODING OF BCH CODES USING LIGHT AND SHORT CODEWORDS RON M. ROTH * AND GADIEL SEROUSSI ** ABSTRACT It is shown that every q-ary primitive BCH code of designed distance δ and sufficiently
More information