The number of message symbols encoded into a
|
|
- Vivien Cross
- 6 years ago
- Views:
Transcription
1 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 with 2 n elements. The number of message symbols encoded into a codeword is M. The number of code symbols transmitted is N=2 n. Message symbols are elements of GF(2 n ). Code symbols are elements of GF(2 n ). 1
2 The original view of Reed and Solomon is that the codeword symbols are the VALUES of a polynomial whose COEFFICIENTS are the message symbols. 2
3 MATHEMATICALLY: Let (x 1 ;x 2 ;;x N )beanenumeration of the elements of the eld. Let (m 1 ;m 2 ;;m M ) be a message where m i 2 GF (2 n ). Dene a polynomial by P (Z) =m 1 +m 2 Z+m 3 Z 2 ++m M Z M,1 Then the codeword is (P (x 1 );P(x 2 );:::;P(x N )) The enumeration used by Reed and Solomon was as follows. Let be a primitive element in GF(2 n ). Then the enumeration is (x 1 ;x 2 ;;x N )=(0;; 2 ;; N,2 ;1) 3
4 Suppose the received word is (R(x 1 );R(x 2 );:::;R(x N )) At the receiver, N equations can be formed, some of which are wrong if there are transmission errors. R(0) = m 1 R() = m 1 + m 2 + m m M M,1 R( 2 ) = m 1 +m 2 +m m M 2(M,1). R(1) = m 1 + m 2 + m 3 + +m M Any M of these equations have full rank and can be solved. By trying many sets of M equations, the correct answer will appear more often than any wrong answer provided the number of errors is less than (2 n, M +1)=2. Choosing M equations and solving those equations is equivalent to Lagrange interpolation. 4
5 THE CLASSICAL VIEW Reed Solomon Codes are a sub type of BCH Codes I don't know who rst made this observation but it leads to a practical decoding algorithm developed by Wes Peterson. Parameters: Let GF(2 n ) be the eld with 2 n elements. Let be a primitive element in GF(2 n ). The number of message symbols encoded into a codeword is M. The number of code symbols transmitted is N =2 n,1. Let G(Z) be the polynomial whose roots are (; 2 ;; N,M ) Message symbols are elements of GF(2 n ). The BCH view is that the symbols of a codeword are the COEFFICIENTS of a polynomial in Z which is divisible by G. 5
6 MATHEMATICALLY: Let G(Z) = N,M Y i=1 (Z, i ) Let (m 1 ;m 2 ;;m M ) be a message where m i 2 GF (2 n ). Dene a polynomial by P (Z) =m 1 +m 2 Z+m 3 Z 2 ++m M Z M,1 and dene C(Z) = P (Z)G(Z) X = N,1 i=0 c i Z i Then the codeword is (c 0 ;c 1 ;;c N,1 ) 6
7 Alternatively, dividing Z N,M P (Z) byg(z)to get Z N,M P (Z) =Q(Z)G(Z)+R(Z) Then C(Z) =Z N,M P(Z),R(Z) is divisible by G(Z) and its coecients form a systematic codeword. 7
8 DECODING AS PRESENTED IN THE REED-SOLOMON PAPER Reed and Solomon described the following decoding procedure. Receive (r 1 ;r 2 ;;r N ) Select M indices in all possible ways (Lagrange Interpolation)For each selection, nd P (Z) with deg(p )=M,1 P(x i )=r i at these indices. The coecients of P form a potential message. As all possible selections are made, the message which gives a codeword closest to the received word occurs more often than any other. 8
9 An alternative is to form a codeword corresponding to each potential message and stop when the result disagrees with the received message in at most (N, M)=2 places. If none is found, failure to decode occurs. These procedures are very inecient. return to this later. We will 9
10 CLASSICAL DECODING [W.W. Peterson, IRE IT-6 Sept 1960] Receive (r 1 ;r 2 ;;r N ) and form R(Z) = C( i ) = 0 N X i=1 r i Z i,1 = C(Z)+E(Z) S i = R( i ) = E( i ) for 1 i N, M for 1 i N, M Peterson observed that the S i satisfy a linear recursion. 0= e X i=0 q i S k+i for 1 k N, M, e where Q(Z) = P e i=0 q iz i has the error locations as its roots. This gives a simple system of linear equations to nd the error locations. Another system solves for the error values. 10
11 Later Berlekamp found a faster algorithm for nding the recursion satised by the S i. 11
12 Let us return to the Reed & Solomon's Original View and see if there is another decoding method. We begin in the same way Reed and Solomon did by selecting a set of M indices, S, and nding P (Z) for which degree of P is at most M, 1 and P (x i )=r i for i 2 S The tool is Lagrange interpolation. We ask what is the eect of errors at the selected indices. 12
13 LAGRANGE INTERPOLATION For each i 2 S we need a polynomial, i (Z), of degree M, 1 which has the value 1 at x i and the value 0 at x j for j 2 S; j 6= i With these, the solution for P is P (Z) = X i2s r i i (Z) If r i includes an error e i then e i i (Z) is added to the correct P (Z). 13
14 SYNDROMES Let T (Z) be the message polynomial and e k be the error at position k Then r k = T (x k )+e k Given an index selection, S, the Lagrange Interpolation polynomial evaluated at x k will be P (x k ) = X r i i (x k ) i2s = X T (x i ) i (x k )+ X e i i (x k ) i2s i2s 14
15 Subtracting the interpolated values from the received values: r k, P (x k ) = T (x k ), X +e k, X i2s i2s T (x i ) i (x k ) e i i (x k ) Since T has degree at most M, 1, and we have T (x k )= X i2s T(x i ) i (x k ) k =r k,p(x k )=e k, X for k 2 S c i2s which is a new family of syndromes. e i i (x k ) Given k for k 2 S c and assuming the number of errors is within the R-S bound, we would like to solve for the e j 's. 15
16 INTERPOLATION POLYNOMIALS Given S, the 's are constructed as follows: Let G(Z) = Y (Z,x j ) j2s and let G 0 (Z) be its formal derivative. Then i (Z) = G(Z) (Z,x i )G 0 (x i ) It is clear that i (x j ) = 0 for i; j 2 S and j 6= i. That i (x i ) = 1 follows from the rule of L'Hospital which is valid for ratios of polynomials over any eld. 16
17 The syndromes can now be expressed as: k = e k, X i2s e i G(x k ) (x k, x i )G 0 (x i ) or k G(x k ) = e k G(x k ), X i2s e i 1 G 0 (x i ) (x k, x i ) This looks simpler if we dene k = k G(x k ) e k = e k G(x k ) for k 2 Sc and e i = e i G 0 (x i ) then k = e k, X i2s e i (x k, x i ) 17
18 Not all of the e's are non-zero. Let E be the set of indices for which e i 6=0 Dene Q S (Z) = Y i2e\s (Z,x i ) and Q C (Z) = Y i2e\s c (Z,x i ) The roots of Q S (Z) are those x i for which i 2 S and e i 6= 0 While the roots of Q C (Z) are those x i for which i 2 S c and e i 6=0 The summation expression in the syndrome equations can now be put over a common denominator to give k = e k, A(x k) Q S (x k ) where the degree of Q S is the number of errors at selected indices and the degree of A is less 18
19 For k 2 S c, either e k =0orQ C (x k ) = 0 so the product is 0 for k 2 S c. Multiplying the previous syndrome expression by Q(x k ) Q S (x k )Q C (x k ) gives Q(x k ) k = Q C(x k )A(x k ) P (x k ) Q(x k ) k = P (x k ) This expression has, as unknowns, the coecients of Q and P and provides a system of linear equations for their solution. At rst glance this looks the same has the Classical case but is not. The classical equations are statements about the relationship between COEF- FICIENTS of polynomials while the above expression is a relation about the VALUES of polynomials. 19
20 A FAST ALGORITHM FOR SOLVING THE WELCH-BERLEKAMP EQUATIONS This algorithm was developed jointly by Elwyn Berlekamp Tze Hua Liu Po Tong Lloyd Welch The Key WB Equations are Q(x k ) k = P (x k ) for k 2 S c (1) These equations will be used sequentially in some order depending on auxillary information such as symbol reliability We will assume that the x k 's are renumbered so that the equations are Q(x k ) k = P (x k) for k =1;;N,M 20
21 We introduce an auxillary pair of polynomials, W (Z);V(Z) and recursively compute an integer and four polynomials as follows J k ;Q k (Z);P k (Z);W k (Z);V k (Z) The pair (Q k ;P k ) will constitute a \minimal" solution to the rst k equations and the pair (W k ;V k ) will also solve the rst k equations but, in a certain sense, will not be minimal. 21
22 Initialization: J 0 =0; Q 0 (Z)=1;P 0 (Z)=0;W 0 (Z)=1;V 0 (Z)=1 Since k = 0, there are no equations to verify. 22
23 When we have generated Q k ;P k ;W k ;V k we will have two solutions to the rst k equations. (Q k ;P k ) and (W k ;V k ) However the pair (W k ;V k ) will be "less suitable" than (Q k ;P k ) in a certain sense. But the pair will be useful in constructing (Q k+1 ;P k+1 ) 23
24 STEP k At the beginning of step k we have J k,1 and Q k,1 (Z);P k,1 (Z);W k,1 (Z);V k,1 (Z) We form d k = Q k,1 (x k ) k, P k,1 (x k ) IF d k =0 J k = J k,1 +1 Q k (Z) = Q k,1 (Z) P k (Z) = P k,1 (Z) W k (Z) = (Z,x k )W k,1 (Z) V k (Z) = (Z,x k )V k,1 (Z) In this case (Q k,1 ;P k,1 ) already satisfy the k'th equation and multiplication by (Z,x k ) forces the pair W k (Z);V k (Z) to satisfy the k'th equation. 24
25 IF d k 6=0 We form another quantity, c k = d,1 k (W k,1 (x k ) k, V k,1(x k )) and set Q k (Z) = (Z, x k )Q k,1 (Z) P k (Z) = (Z, x k )P k,1 (Z) W k (Z) = W k,1, c k Q k,1 (Z) V k (Z) = V k,1, c k P k,1 (Z) It is readily veried that the two pair of polynomials satisfy the rst k equations. HOWEVER, we are not done with this case. IF J k,1 = 0 then swap the two pair. Q k (Z) $ W k (Z) P k (Z) $ V k (Z) and set J k =0 OTHERWISE set J k = J k,1, 1 and do not swap pairs. 25
26 A MATRIX DESCRIPTION The four polynomials can be written as components of a matrix. 0 Q k(z) P k (Z) W k (Z) V k (Z) 1 C A In this form the k'th step can be written 26
27 IF d k =0 0 Q k(z) P k (Z) W k (Z) V k (Z) 1 C A= (Z,x k ) 10 C A Q k,1(z) P k,1 (Z) W k,1 (Z) V k,1 (Z) 1 C A IF d k 6= 0 and J k,1 6=0 0 Q k(z) P k (Z) W k (Z) V k (Z) 1 C A= 0 (Z,x k) 0 c k 1 10 C A Q k,1(z) P k,1 (Z) W k,1 (Z) V k,1 (Z) 1 C A IF d k 6= 0 and J k,1 =0 0 Q k(z) P k (Z) W k (Z) V k (Z) 1 C A= 0 k 1 (Z,x k ) 1 10 C A Q k,1(z) P k,1 (Z) W k,1 (Z) V k,1 (Z) 1 C A 27
28 The fact that each pair, (Q k (Z);P k (Z)) and (W k (Z);V k (Z)) satisfy the rst k equations can be expressed as 0 Q k(x i ) P k (x i ) W k (x i ) V k (x i ) 1 0 C A i,1 1 C A = C A for i k 28
29 WHAT ABOUT MINIMALITY? This is the dicult part of the theorem and I will just outline the proof with a few comments. I will pattern this proof after that in Tze Hwa Liu's dissertation ( 1984) 29
30 First we are going to replace the decision criterion using J k by something more intuitive. ( It is equivalent) Dene the length of an ordered pair of polynomials by L(Q(Z);P(Z)) = max(deg(q),1+deg(p )) and dene L k = min L(Q(Z);P(Z)) where the minimum is taken over all pairs of polynomials satisfying the rst k equations. 30
31 THEOREM: The algorithm described above gives a sequence of pairs, (Q k (Z);P k (Z)) for which L k = L(Q k (Z);P k (Z)) That is: (Q k (Z);P k (Z)) is minimal. I will just list the lemmas, with a comment about some of them. Lemma 1 L k is monotone increasing. Lemma 2 If 2L k k then there is a unique minimum pair satisfying the rst k equations. 31
32 Lemma 3 If 2L k k and d k+1 6=0 when computed for a minimal pair at level k then L k+1 = L k +1 *** Lemma 4 Q k (Z) P k (Z) W k (Z) V k (Z) = Y k i=1 (Z, x i ) (determinant of product is product of determinants) 32
33 Lemmas 5,6 L(Q k (Z);P k (Z)) + L(W k (Z);V k (Z)) = k +1 THE SWAP PAIRS DECISION The swap pairs decision based on the value of J k is really the comparison of L(Q k (Z);P k (Z)) and L(W k (Z);V k (Z)) and picking L(Q k (Z);P k (Z)) to be the smaller. 33
34 We restate the theorem: THEOREM: The algorithm described above gives a sequence of pairs, (Q k (Z);P k (Z)) for which L k = L(Q k (Z);P k (Z)) That is: (Q k (Z);P k (Z)) is minimal. 34
Great Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Polynomials, Lagrange, and Error-correction Lecture 23 (November 10, 2009) P(X) = X 3 X 2 + + X 1 + Definition: Recall: Fields A field F is a set together
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 informationDecoding Reed-Muller codes over product sets
Rutgers University May 30, 2016 Overview Error-correcting codes 1 Error-correcting codes Motivation 2 Reed-Solomon codes Reed-Muller codes 3 Error-correcting codes Motivation Goal: Send a message Don t
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 information1 Reed Solomon Decoder Final Project. Group 3 Abhinav Agarwal S Branavan Grant Elliott. 14 th May 2007
1 Reed Solomon Decoder 6.375 Final Project Group 3 Abhinav Agarwal S Branavan Grant Elliott 14 th May 2007 2 Outline Error Correcting Codes Mathematical Foundation of Reed Solomon Codes Decoder Architecture
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 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 informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Discussion 6A Solution
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Discussion 6A Solution 1. Polynomial intersections Find (and prove) an upper-bound on the number of times two distinct degree
More informationComplex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i
Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i 2 = 1 Sometimes we like to think of i = 1 We can treat
More informationCS 70 Discrete Mathematics and Probability Theory Summer 2016 Dinh, Psomas, and Ye Discussion 8A Sol
CS 70 Discrete Mathematics and Probability Theory Summer 2016 Dinh, Psomas, and Ye Discussion 8A Sol First two questions are rehashes of 7D. Skip if covered already. 1. Visualizing error correction Alice
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 informationOn Irreducible Polynomial Remainder Codes
2011 IEEE International Symposium on Information Theory Proceedings On Irreducible Polynomial Remainder Codes Jiun-Hung Yu and Hans-Andrea Loeliger Department of Information Technology and Electrical Engineering
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 informationEE512: Error Control Coding
EE51: Error Control Coding Solution for Assignment on BCH and RS Codes March, 007 1. To determine the dimension and generator polynomial of all narrow sense binary BCH codes of length n = 31, we have to
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 information3x + 1 (mod 5) x + 2 (mod 5)
Today. Secret Sharing. Polynomials Polynomials. Secret Sharing. Share secret among n people. Secrecy: Any k 1 knows nothing. Roubustness: Any k knows secret. Efficient: minimize storage. A polynomial P(x)
More information4F5: Advanced Communications and Coding
4F5: Advanced Communications and Coding Coding Handout 4: Reed Solomon Codes Jossy Sayir Signal Processing and Communications Lab Department of Engineering University of Cambridge jossy.sayir@eng.cam.ac.uk
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 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 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 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 informationLecture Introduction. 2 Formal Definition. CS CTT Current Topics in Theoretical CS Oct 30, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 30, 0 Lecturer: Elena Grigorescu Lecture 9 Scribe: Vivek Patel Introduction In this lecture we study locally decodable codes. Locally decodable codes are
More informationNotes 10: List Decoding Reed-Solomon Codes and Concatenated codes
Introduction to Coding Theory CMU: Spring 010 Notes 10: List Decoding Reed-Solomon Codes and Concatenated codes April 010 Lecturer: Venkatesan Guruswami Scribe: Venkat Guruswami & Ali Kemal Sinop DRAFT
More informationSection 0.2 & 0.3 Worksheet. Types of Functions
MATH 1142 NAME Section 0.2 & 0.3 Worksheet Types of Functions Now that we have discussed what functions are and some of their characteristics, we will explore different types of functions. Section 0.2
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 informationPermutations and Polynomials Sarah Kitchen February 7, 2006
Permutations and Polynomials Sarah Kitchen February 7, 2006 Suppose you are given the equations x + y + z = a and 1 x + 1 y + 1 z = 1 a, and are asked to prove that one of x,y, and z is equal to a. We
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 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 informationDecoding Procedure for BCH, Alternant and Goppa Codes defined over Semigroup Ring
Decoding Procedure for BCH, Alternant and Goppa Codes defined over Semigroup Ring Antonio Aparecido de Andrade Department of Mathematics, IBILCE, UNESP, 15054-000, São José do Rio Preto, SP, Brazil E-mail:
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 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 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 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 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 informationSimplifying Rational Expressions and Functions
Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written
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 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 informationPolynomial Codes over Certain Finite Fields
Polynomial Codes over Certain Finite Fields A paper by: Irving Reed and Gustave Solomon presented by Kim Hamilton March 31, 2000 Significance of this paper: Introduced ideas that form the core of current
More informationError Correction Methods
Technologies and Services on igital Broadcasting (7) Error Correction Methods "Technologies and Services of igital Broadcasting" (in Japanese, ISBN4-339-06-) is published by CORONA publishing co., Ltd.
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 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 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 informationReverse Berlekamp-Massey Decoding
Reverse Berlekamp-Massey Decoding Jiun-Hung Yu and Hans-Andrea Loeliger Department of Information Technology and Electrical Engineering ETH Zurich, Switzerland Email: {yu, loeliger}@isi.ee.ethz.ch arxiv:1301.736v
More informationVLSI Architecture of Euclideanized BM Algorithm for Reed-Solomon Code
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2, 4-4 (29) VLSI Architecture of Euclideanized BM Algorithm for Reed-Solomon Code HUANG-CHI CHEN,2, YU-WEN CHANG 3 AND REY-CHUE HWANG Deaprtment of Electrical
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. Ruud Pellikaan MasterMath 2MMC30. Lecture 11.1 May
Coding Theory Ruud Pellikaan g.r.pellikaan@tue.nl MasterMath 2MMC30 /k Lecture 11.1 May 12-2016 Content lecture 11 2/31 In Lecture 8.2 we introduced the Key equation Now we introduce two algorithms which
More informationFast Decoding Of Alternant Codes Using A Divison-Free Analog Of An Accelerated Berlekamp-Massey Algorithm
Fast Decoding Of Alternant Codes Using A Divison-Free Analog Of An Accelerated Berlekamp-Massey Algorithm MARC A. ARMAND WEE SIEW YEN Department of Electrical & Computer Engineering National University
More informationInformation redundancy
Information redundancy Information redundancy add information to date to tolerate faults error detecting codes error correcting codes data applications communication memory p. 2 - Design of Fault Tolerant
More informationCHAPTER 2 POLYNOMIALS KEY POINTS
CHAPTER POLYNOMIALS KEY POINTS 1. Polynomials of degrees 1, and 3 are called linear, quadratic and cubic polynomials respectively.. A quadratic polynomial in x with real coefficient is of the form a x
More informationContents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains
Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and
More informationSection Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence.
Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence. Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence. f n (0)x n Recall from
More informationToday. Polynomials. Secret Sharing.
Today. Polynomials. Secret Sharing. A secret! I have a secret! A number from 0 to 10. What is it? Any one of you knows nothing! Any two of you can figure it out! Example Applications: Nuclear launch: need
More informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationDr. Cathy Liu Dr. Michael Steinberger. A Brief Tour of FEC for Serial Link Systems
Prof. Shu Lin Dr. Cathy Liu Dr. Michael Steinberger U.C.Davis Avago SiSoft A Brief Tour of FEC for Serial Link Systems Outline Introduction Finite Fields and Vector Spaces Linear Block Codes Cyclic Codes
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 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 informationPolynomial Review Problems
Polynomial Review Problems 1. Find polynomial function formulas that could fit each of these graphs. Remember that you will need to determine the value of the leading coefficient. The point (0,-3) is on
More information, a 1. , a 2. ,..., a n
CHAPTER Points to Remember :. Let x be a variable, n be a positive integer and a 0, a, a,..., a n be constants. Then n f ( x) a x a x... a x a, is called a polynomial in variable x. n n n 0 POLNOMIALS.
More informationHomework 9 Solutions to Selected Problems
Homework 9 Solutions to Selected Problems June 11, 2012 1 Chapter 17, Problem 12 Since x 2 + x + 4 has degree 2 and Z 11 is a eld, we may use Theorem 17.1 and show that f(x) is irreducible because it has
More informationSpring Ammar Abu-Hudrouss Islamic University Gaza
Chaper 7 Reed-Solomon Code Spring 9 Ammar Abu-Hudrouss Islamic Universiy Gaza ١ Inroducion A Reed Solomon code is a special case of a BCH code in which he lengh of he code is one less han he size of he
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
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 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 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 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 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 informationELEC3227/4247 Mid term Quiz2 Solution with explanation
ELEC7/447 Mid term Quiz Solution with explanation Ang Man Shun Department of Electrical and Electronic Engineering, University of Hong Kong Document creation date : 015 1 05 This document explain the solution
More informationCommunications II Lecture 9: Error Correction Coding. Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved
Communications II Lecture 9: Error Correction Coding Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved Outline Introduction Linear block codes Decoding Hamming
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 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 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 informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationSimplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey
2014 IJEDR Volume 2, Issue 1 ISSN: 2321-9939 Simplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey 1 Vivek Tilavat, 2 Dr.Yagnesh Shukla 1 PG Student,
More informationLinear Algebra, 3rd day, Wednesday 6/30/04 REU Info:
Linear Algebra, 3rd day, Wednesday 6/30/04 REU 2004. Info: http://people.cs.uchicago.edu/laci/reu04. Instructor: Laszlo Babai Scribe: Richard Cudney Rank Let V be a vector space. Denition 3.. Let S V,
More informationL1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen
L1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen In this section you will apply the method of long division to divide a polynomial by a binomial. You will also learn to
More informationProof: Let the check matrix be
Review/Outline Recall: Looking for good codes High info rate vs. high min distance Want simple description, too Linear, even cyclic, plausible Gilbert-Varshamov bound for linear codes Check matrix criterion
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 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 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 informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Discussion 6B Solution
CS 70 Discrete Mathematics and Probability Theory Spring 016 Rao and Walrand Discussion 6B Solution 1. GCD of Polynomials Let A(x) and B(x) be polynomials (with coefficients in R or GF(m)). We say that
More informationSolutions to Exercises, Section 2.5
Instructor s Solutions Manual, Section 2.5 Exercise 1 Solutions to Exercises, Section 2.5 For Exercises 1 4, write the domain of the given function r as a union of intervals. 1. r(x) 5x3 12x 2 + 13 x 2
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 informationMonte Carlo Methods for Statistical Inference: Variance Reduction Techniques
Monte Carlo Methods for Statistical Inference: Variance Reduction Techniques Hung Chen hchen@math.ntu.edu.tw Department of Mathematics National Taiwan University 3rd March 2004 Meet at NS 104 On Wednesday
More informationERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED SOLOMON CODES
Journal of ELECTRICAL ENGINEERING, VOL. 54, NO. -2, 2003, 305 30 ERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED SOLOMON CODES Sergey Egorov Garik Markarian A modification of Blahut procedure
More informationNew Reed Solomon Encoder Design Using Galois Subfield Multiplier
New Reed Solomon Encoder Design Using Galois Subfield Multiplier Hyeong-Keon An*, Jin-Young Kim** *Dept. of Information & Communications Engineering, Tongmyong University of Information Technology, Busan
More informationPAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes
359 PAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes Ching-Lung CHR a),szu-linsu, Members, and Shao-Wei WU, Nonmember SUMMARY A low-complexity step-by-step decoding algorithm
More informationList Decoding of Binary Goppa Codes up to the Binary Johnson Bound
List Decoding of Binary Goppa Codes up to the Binary Johnson Bound Daniel Augot Morgan Barbier Alain Couvreur École Polytechnique INRIA Saclay - Île de France ITW 2011 - Paraty Augot - Barbier - Couvreur
More informationAP Calculus Chapter 9: Infinite Series
AP Calculus Chapter 9: Infinite Series 9. Sequences a, a 2, a 3, a 4, a 5,... Sequence: A function whose domain is the set of positive integers n = 2 3 4 a n = a a 2 a 3 a 4 terms of the sequence Begin
More informationDecoding Algorithm and Architecture for BCH Codes under the Lee Metric
Decoding Algorithm and Architecture for BCH Codes under the Lee Metric Yingquan Wu and Christoforos N. Hadjicostis Coordinated Science Laboratory and Department of Electrical and Computer Engineering University
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 information1/30: Polynomials over Z/n.
1/30: Polynomials over Z/n. Last time to establish the existence of primitive roots we rely on the following key lemma: Lemma 6.1. Let s > 0 be an integer with s p 1, then we have #{α Z/pZ α s = 1} = s.
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 informationPolynomial functions over nite commutative rings
Polynomial functions over nite commutative rings Balázs Bulyovszky a, Gábor Horváth a, a Institute of Mathematics, University of Debrecen, Pf. 400, Debrecen, 4002, Hungary Abstract We prove a necessary
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 informationMinimized Logic Gates Number Of Components In The Chien Search Block For Reed-Solomon (RS)
Research Paper American Journal of Engineering Research (AJER) e-issn: 2320-0847 p-issn : 2320-0936 Volume-7, Issue-2, pp-110-116 www.ajer.org Open Access Minimized Logic Gates Number Of Components In
More informationLecture 8 - Algebraic Methods for Matching 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 1, 2018 Lecture 8 - Algebraic Methods for Matching 1 In the last lecture we showed that
More informationREED-SOLOMON codes are powerful techniques for
1 Efficient algorithms for decoding Reed-Solomon codes with erasures Todd Mateer Abstract In this paper, we present a new algorithm for decoding Reed-Solomon codes with both errors and erasures. The algorithm
More informationOn the NP-Hardness of Bounded Distance Decoding of Reed-Solomon Codes
On the NP-Hardness of Bounded Distance Decoding of Reed-Solomon Codes Venkata Gandikota Purdue University vgandiko@purdue.edu Badih Ghazi MIT badih@mit.edu Elena Grigorescu Purdue University elena-g@purdue.edu
More informationLecture 03: Polynomial Based Codes
Lecture 03: Polynomial Based Codes Error-Correcting Codes (Spring 016) Rutgers University Swastik Kopparty Scribes: Ross Berkowitz & Amey Bhangale 1 Reed-Solomon Codes Reed Solomon codes are large alphabet
More informationL1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen
L1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen In this section you will apply the method of long division to divide a polynomial by a binomial. You will also learn to
More information