Skew cyclic codes: Hamming distance and decoding algorithms 1
|
|
- Cameron Hubbard
- 5 years ago
- Views:
Transcription
1 Skew cyclic codes: Hamming distance and decoding algorithms 1 J. Gómez-Torrecillas, F. J. Lobillo, G. Navarro Department of Algebra and CITIC, University of Granada Department of Computer Sciences and AI, and CITIC, University of Granada NCRA V, Lens, June 14, Research supported by grants MTM P and MTM P from Spanish government and FEDER. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (1)
2 Based on: GLN, Generating idempotents in ideal codes, ACM Communications in Computer Algebra, Vol 48, No. 3, Issue 189, September 2014, ISSAC poster abstracts, pp GLN, A new perspective of cyclicity in convolutional codes, IEEE Transactions on Information Theory 62 (5) (2016), GLN, A Sugiyama-like decoding algorithm for convolutional codes, arxiv: GLN, Ideal codes over separable ring extensions, IEEE Transactions on Information Theory 63 (5) (2017), GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (2)
3 Index 1 Motivation: Cyclic Convolutional Codes 2 Skew Reed-Solomon codes 3 Decoding GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (3)
4 Convolutional codes F a finite field, k n positive integers. A rate k/n convolutional transducer G transforms into information sequences u =... u 1 u 0 u 1... (u i F k ) code sequences v =... v 1 v 0 v 1... (v i F n ). GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (4)
5 Convolutional codes F a finite field, k n positive integers. A rate k/n convolutional transducer G transforms information sequences u =... u 1 u 0 u 1... (u i F k ) into code sequences v =... v 1 v 0 v 1... (v i F n ). Requirements: Write u = i= i 0 u i t i F k ((t)) = F((t)) k, v = j= j 0 v i t j F n ((t)) = F((t)) n. Then v = ug, where G is an k n full rank matrix with entries in F(t). GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (4)
6 Convolutional codes F a finite field, k n positive integers. A rate k/n convolutional transducer G transforms into information sequences u =... u 1 u 0 u 1... (u i F k ) code sequences v =... v 1 v 0 v 1... (v i F n ). Requirements: Write u = i= i 0 u i t i F k ((t)) = F((t)) k, v = j= j 0 v i t j F n ((t)) = F((t)) n. Then v = ug, where G is an k n full rank matrix with entries in F(t). Definition A rate k/n convolutional code D over F is the image of a rate k/n convolutional transducer G, that is D = {ug : u F k ((t))} F n ((t)). GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (4)
7 Convolutional codes F a finite field, k n positive integers. A rate k/n convolutional transducer G transforms into information sequences u =... u 1 u 0 u 1... (u i F k ) code sequences v =... v 1 v 0 v 1... (v i F n ). Requirements: Write u = i= i 0 u i t i F k ((t)) = F((t)) k, v = j= j 0 v i t j F n ((t)) = F((t)) n. Then v = ug, where G is an k n full rank matrix with entries in F(t). Definition A rate k/n convolutional code D over F is the image of a rate k/n convolutional transducer G, that is D = {ug : u F k ((t))} F n ((t)). Definition (Vector space version) A rate k/n convolutional code over F is a k dimensional vector subspace of F(t) n. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (4)
8 Cyclic convolutional codes (module version) Lemma The map D D F n [t] is a bijection between the set of rate k/n convolutional codes and the set of submodules of rank k of F n [t] = F[t] n that are direct summands. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (5)
9 Cyclic convolutional codes (module version) Lemma The map D D F n [t] is a bijection between the set of rate k/n convolutional codes and the set of submodules of rank k of F n [t] = F[t] n that are direct summands. Definition (Module version) A rate k/n convolutional code is a rank k direct summand of F n [t]. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (5)
10 Cyclic convolutional codes (module version) Lemma The map D D F n [t] is a bijection between the set of rate k/n convolutional codes and the set of submodules of rank k of F n [t] = F[t] n that are direct summands. Definition (Module version) A rate k/n convolutional code is a rank k direct summand of F n [t]. Thus, a cyclic structure could be introduced by taking F n = A := F[x]/ x n 1, and suitable ideals of A[t] as cyclic convolutional codes. But... GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (5)
11 Cyclic convolutional codes (module version) Lemma The map D D F n [t] is a bijection between the set of rate k/n convolutional codes and the set of submodules of rank k of F n [t] = F[t] n that are direct summands. Definition (Module version) A rate k/n convolutional code is a rank k direct summand of F n [t]. Thus, a cyclic structure could be introduced by taking F n = A := F[x]/ x n 1, and suitable ideals of A[t] as cyclic convolutional codes. But... Problem: Piret (1976) observed that no non-block codes are obtained in this way. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (5)
12 Cyclic convolutional codes (module version) Lemma The map D D F n [t] is a bijection between the set of rate k/n convolutional codes and the set of submodules of rank k of F n [t] = F[t] n that are direct summands. Definition (Module version) A rate k/n convolutional code is a rank k direct summand of F n [t]. Thus, a cyclic structure could be introduced by taking F n = A := F[x]/ x n 1, and suitable ideals of A[t] as cyclic convolutional codes. But... Problem: Piret (1976) observed that no non-block codes are obtained in this way. Solution: Piret s (1976) idea is skewing the multiplication of A[t]. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (5)
13 Cyclic convolutional codes (module version) Lemma The map D D F n [t] is a bijection between the set of rate k/n convolutional codes and the set of submodules of rank k of F n [t] = F[t] n that are direct summands. Definition (Module version) A rate k/n convolutional code is a rank k direct summand of F n [t]. Thus, a cyclic structure could be introduced by taking F n = A := F[x]/ x n 1, and suitable ideals of A[t] as cyclic convolutional codes. But... Problem: Piret (1976) observed that no non-block codes are obtained in this way. Solution: Piret s (1976) idea is skewing the multiplication of A[t]. Technically, this means to define cyclic convolutional codes as suitable left ideals of a skew polynomial ring A[t; σ]. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (5)
14 Cyclic convolutional codes (module version) Lemma The map D D F n [t] is a bijection between the set of rate k/n convolutional codes and the set of submodules of rank k of F n [t] = F[t] n that are direct summands. Definition (Module version) A rate k/n convolutional code is a rank k direct summand of F n [t]. Thus, a cyclic structure could be introduced by taking F n = A := F[x]/ x n 1, and suitable ideals of A[t] as cyclic convolutional codes. But... Problem: Piret (1976) observed that no non-block codes are obtained in this way. Solution: Piret s (1976) idea is skewing the multiplication of A[t]. Technically, this means to define cyclic convolutional codes as suitable left ideals of a skew polynomial ring A[t; σ]. This idea has been further developed, (e.g. considering more general finite F algebras A) by Roos (1979), Gluesing-Luerssen/Schmale (2004), López-Permouth/Szabo (2013), GLN (2014, 2017), among others. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (5)
15 Cyclic convolutional codes (module version) Lemma The map D D F n [t] is a bijection between the set of rate k/n convolutional codes and the set of submodules of rank k of F n [t] = F[t] n that are direct summands. Definition (Module version) A rate k/n convolutional code is a rank k direct summand of F n [t]. Thus, a cyclic structure could be introduced by taking F n = A := F[x]/ x n 1, and suitable ideals of A[t] as cyclic convolutional codes. But... Problem: Piret (1976) observed that no non-block codes are obtained in this way. Solution: Piret s (1976) idea is skewing the multiplication of A[t]. Technically, this means to define cyclic convolutional codes as suitable left ideals of a skew polynomial ring A[t; σ]. This idea has been further developed, (e.g. considering more general finite F algebras A) by Roos (1979), Gluesing-Luerssen/Schmale (2004), López-Permouth/Szabo (2013), GLN (2014, 2017), among others. Main difficulty/opportunity: Dealing with idempotents in A[t; σ]. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (5)
16 Cyclic convolutional codes (vector space version). Would we define a cyclic convolutional code as an ideal of F(t)[x]/ x n 1 = F(t) n? GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (6)
17 Cyclic convolutional codes (vector space version). Would we define a cyclic convolutional code as an ideal of F(t)[x]/ x n 1 = F(t) n? If so, then we get nothing but cyclic block codes (the factors of x n 1 have coefficients in F). GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (6)
18 Cyclic convolutional codes (vector space version). Would we define a cyclic convolutional code as an ideal of F(t)[x]/ x n 1 = F(t) n? If so, then we get nothing but cyclic block codes (the factors of x n 1 have coefficients in F). Proposal: (GLN (2016)). A cyclic convolutional could be a left ideal of R = F(t)[x; σ]/ x n 1, where σ is an F automorphism of order n of F(t). GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (6)
19 Cyclic convolutional codes (vector space version). Would we define a cyclic convolutional code as an ideal of F(t)[x]/ x n 1 = F(t) n? If so, then we get nothing but cyclic block codes (the factors of x n 1 have coefficients in F). Proposal: (GLN (2016)). A cyclic convolutional could be a left ideal of R = F(t)[x; σ]/ x n 1, where σ is an F automorphism of order n of F(t). Features: F(t)[x; σ] is a left and right Euclidean domain. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (6)
20 Cyclic convolutional codes (vector space version). Would we define a cyclic convolutional code as an ideal of F(t)[x]/ x n 1 = F(t) n? If so, then we get nothing but cyclic block codes (the factors of x n 1 have coefficients in F). Proposal: (GLN (2016)). A cyclic convolutional could be a left ideal of R = F(t)[x; σ]/ x n 1, where σ is an F automorphism of order n of F(t). Features: F(t)[x; σ] is a left and right Euclidean domain. F(t)[x; σ]/ x n 1 = M n (F(t) σ ). GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (6)
21 Cyclic convolutional codes (vector space version). Would we define a cyclic convolutional code as an ideal of F(t)[x]/ x n 1 = F(t) n? If so, then we get nothing but cyclic block codes (the factors of x n 1 have coefficients in F). Proposal: (GLN (2016)). A cyclic convolutional could be a left ideal of R = F(t)[x; σ]/ x n 1, where σ is an F automorphism of order n of F(t). Features: F(t)[x; σ] is a left and right Euclidean domain. F(t)[x; σ]/ x n 1 = M n (F(t) σ ). When the generator of the code is carefully chosen, we get an MDS code with respect to the Hamming distance. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (6)
22 Cyclic convolutional codes (vector space version). Would we define a cyclic convolutional code as an ideal of F(t)[x]/ x n 1 = F(t) n? If so, then we get nothing but cyclic block codes (the factors of x n 1 have coefficients in F). Proposal: (GLN (2016)). A cyclic convolutional could be a left ideal of R = F(t)[x; σ]/ x n 1, where σ is an F automorphism of order n of F(t). Features: F(t)[x; σ] is a left and right Euclidean domain. F(t)[x; σ]/ x n 1 = M n (F(t) σ ). When the generator of the code is carefully chosen, we get an MDS code with respect to the Hamming distance. Efficient decoding schemes (like Sugiyama, or Peterson-Gorenstein-Zierler) are adapted to this non-commutative setting. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (6)
23 Cyclic convolutional codes (vector space version). Would we define a cyclic convolutional code as an ideal of F(t)[x]/ x n 1 = F(t) n? If so, then we get nothing but cyclic block codes (the factors of x n 1 have coefficients in F). Proposal: (GLN (2016)). A cyclic convolutional could be a left ideal of R = F(t)[x; σ]/ x n 1, where σ is an F automorphism of order n of F(t). Features: F(t)[x; σ] is a left and right Euclidean domain. F(t)[x; σ]/ x n 1 = M n (F(t) σ ). When the generator of the code is carefully chosen, we get an MDS code with respect to the Hamming distance. Efficient decoding schemes (like Sugiyama, or Peterson-Gorenstein-Zierler) are adapted to this non-commutative setting. The theory (including the algorithms) work for any field L. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (6)
24 Skew cyclic codes So, let L be a field, and σ : L L a field automorphism of finite order n. Set K = L σ. Consider the ring R = L[x; σ]/ x n 1 = M n (K). Note: The multiplication rule in L[x; σ] is xa = σ(a)x for all a L. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (7)
25 Skew cyclic codes So, let L be a field, and σ : L L a field automorphism of finite order n. Set K = L σ. Consider the ring R = L[x; σ]/ x n 1 = M n (K). Note: The multiplication rule in L[x; σ] is xa = σ(a)x for all a L. We have the isomorphism of L vector spaces p : L n R sending (c 0, c 1,..., c n 1 ) onto c 0 + c 1 x + + c n 1 x n 1. Note: The classical identification of equivalence classes and its representatives is (and will be) made. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (7)
26 Skew cyclic codes So, let L be a field, and σ : L L a field automorphism of finite order n. Set K = L σ. Consider the ring R = L[x; σ]/ x n 1 = M n (K). Note: The multiplication rule in L[x; σ] is xa = σ(a)x for all a L. We have the isomorphism of L vector spaces p : L n R sending (c 0, c 1,..., c n 1 ) onto c 0 + c 1 x + + c n 1 x n 1. Note: The classical identification of equivalence classes and its representatives is (and will be) made. Definition A k dimensional L linear code C L n of dimension n is said to be a skew cyclic code if p(c) is a left ideal of R. Note: We will identify C with p(c). Since every left ideal of R is principal, we will often speak of the skew code generated by a polynomial, aggravating the abuse of language. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (7)
27 Skew cyclic codes So, let L be a field, and σ : L L a field automorphism of finite order n. Set K = L σ. Consider the ring R = L[x; σ]/ x n 1 = M n (K). Note: The multiplication rule in L[x; σ] is xa = σ(a)x for all a L. We have the isomorphism of L vector spaces p : L n R sending (c 0, c 1,..., c n 1 ) onto c 0 + c 1 x + + c n 1 x n 1. Note: The classical identification of equivalence classes and its representatives is (and will be) made. Definition A k dimensional L linear code C L n of dimension n is said to be a skew cyclic code if p(c) is a left ideal of R. Note: We will identify C with p(c). Since every left ideal of R is principal, we will often speak of the skew code generated by a polynomial, aggravating the abuse of language. Note: When L = F is a finite field, these codes lie in the realm of the theory developed by Boucher/Chaussade/Geiselmann/Loidreau/Ulmer (2007, 2009), among others, where the name is taken. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (7)
28 Skew RS codes Idea: Choosing carefully generator polynomials of skew codes, we get very concrete results. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (8)
29 Skew RS codes Idea: Choosing carefully generator polynomials of skew codes, we get very concrete results. Construction method of Skew RS codes Choose a normal basis {α, σ(α),..., σ n 1 (α)} of the field extension L/K. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (8)
30 Skew RS codes Idea: Choosing carefully generator polynomials of skew codes, we get very concrete results. Construction method of Skew RS codes Choose a normal basis {α, σ(α),..., σ n 1 (α)} of the field extension L/K. Set β = α 1 σ(α) GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (8)
31 Skew RS codes Idea: Choosing carefully generator polynomials of skew codes, we get very concrete results. Construction method of Skew RS codes Choose a normal basis {α, σ(α),..., σ n 1 (α)} of the field extension L/K. Set β = α 1 σ(α) x n 1 decomposes as the least common left multiple x n 1 = [ x β, x σ(β), x σ 2 (β),..., x σ n 1 (β) ] l GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (8)
32 Skew RS codes Idea: Choosing carefully generator polynomials of skew codes, we get very concrete results. Construction method of Skew RS codes Choose a normal basis {α, σ(α),..., σ n 1 (α)} of the field extension L/K. Set β = α 1 σ(α) x n 1 decomposes as the least common left multiple x n 1 = [ x β, x σ(β), x σ 2 (β),..., x σ n 1 (β) ] l For 1 k < n, the left ideal C of R generated by g = [ x β, x σ(β), x σ 2 (β),..., x σ n k 1 (β) ] l is an SCC of length n and dimension k. We call them Reed-Solomon skew codes. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (8)
33 Skew RS codes Idea: Choosing carefully generator polynomials of skew codes, we get very concrete results. Construction method of Skew RS codes Choose a normal basis {α, σ(α),..., σ n 1 (α)} of the field extension L/K. Set β = α 1 σ(α) x n 1 decomposes as the least common left multiple x n 1 = [ x β, x σ(β), x σ 2 (β),..., x σ n 1 (β) ] l For 1 k < n, the left ideal C of R generated by g = [ x β, x σ(β), x σ 2 (β),..., x σ n k 1 (β) ] l is an SCC of length n and dimension k. We call them Reed-Solomon skew codes. Theorem The Hamming minimum distance of C is δ = n k + 1. Thus, it is an MDS code. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (8)
34 Parity check matrix A parity check matrix of the skew RS code is given by N 0 (β) N 0 (σ(β))... N 0 (σ n k 1 (β)) N 1 (β) N 1 (σ(β))... N 1 (σ n k 1 (β)) H = N 2 (β) N 2 (σ(β))... N 2 (σ n k 1 (β)) N n 1 (β) N n 1 (σ(β))... N n 1 (σ n k 1 (β)) Here, for γ L, N j (γ) = γσ(γ)... σ j 1 (γ) is the remainder of the left division of x j by x γ, that is x j = q(x)(x γ) + N j (γ). GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (9)
35 Transmission and syndromes Our skew RS code C is generated by g = [ x β, x σ(β), x σ 2 (β),..., x σ n k 1 (β) ] l GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (10)
36 Transmission and syndromes Our skew RS code C is generated by g = [ x β, x σ(β), x σ 2 (β),..., x σ n k 1 (β) ] l Set τ = δ 1 2 = n k 2 which is the maximum number of errors that the code can correct. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (10)
37 Transmission and syndromes Our skew RS code C is generated by g = [ x β, x σ(β), x σ 2 (β),..., x σ n k 1 (β) ] l Set τ = δ 1 2 = n k 2 which is the maximum number of errors that the code can correct. m c = mg y = c + e k 1 m i x i i=0 n 1 c i x i i=0 n 1 ν c i x i + e j x kj i=0 j=1 ν τ message encoded received GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (10)
38 Transmission and syndromes Our skew RS code C is generated by g = [ x β, x σ(β), x σ 2 (β),..., x σ n k 1 (β) ] l Set τ = δ 1 2 = n k 2 which is the maximum number of errors that the code can correct. m c = mg y = c + e k 1 m i x i i=0 n 1 c i x i i=0 n 1 ν c i x i + e j x kj i=0 j=1 ν τ message encoded received From the received polynomial y = n 1 j=0 y jx j we can compute the syndromes n 1 S i = y j N j (σ i (β)), i = 0,..., n 1 j=0 GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (10)
39 Error locator and error evaluator We thus know the syndrome polynomial, defined as S = 2τ 1 i=0 σ i (α)s i x i. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (11)
40 Error locator and error evaluator We thus know the syndrome polynomial, defined as Define the locator polynomial S = 2τ 1 i=0 σ i (α)s i x i. λ = [1 σ k1 (β)x, 1 σ k2 (β)x,..., 1 σ kν (β)x] r GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (11)
41 Error locator and error evaluator We thus know the syndrome polynomial, defined as Define the locator polynomial S = 2τ 1 i=0 σ i (α)s i x i. λ = [1 σ k1 (β)x, 1 σ k2 (β)x,..., 1 σ kν (β)x] r For 1 j ν we thus know that there is p j of degree ν 1 such that λ = (1 σ kj (β)x)p j. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (11)
42 Error locator and error evaluator We thus know the syndrome polynomial, defined as Define the locator polynomial S = 2τ 1 i=0 σ i (α)s i x i. λ = [1 σ k1 (β)x, 1 σ k2 (β)x,..., 1 σ kν (β)x] r For 1 j ν we thus know that there is p j of degree ν 1 such that λ = (1 σ kj (β)x)p j. Define the evaluator polynomial ν ω = e j σ kj (α)p j (1) j=1 GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (11)
43 Error locator and error evaluator We thus know the syndrome polynomial, defined as Define the locator polynomial S = 2τ 1 i=0 σ i (α)s i x i. λ = [1 σ k1 (β)x, 1 σ k2 (β)x,..., 1 σ kν (β)x] r For 1 j ν we thus know that there is p j of degree ν 1 such that λ = (1 σ kj (β)x)p j. Define the evaluator polynomial ν ω = e j σ kj (α)p j (1) j=1 Sugiyama s decoding scheme. If λ is computed, then the error positions k 1,..., k ν are derived. With these at hand, we can compute p 1,..., p ν. Finally, the error values e 1,..., e ν are computed by solving a linear system from (1), whenever ω is known. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (11)
44 The non-commutative key equation Theorem These polynomials satisfy the non-commutative key equation for some u of degree smaller than ν. ω = Sλ + x 2τ u, GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (12)
45 The non-commutative key equation Theorem These polynomials satisfy the non-commutative key equation for some u of degree smaller than ν. Theorem The non-commutative key equation is a right multiple of the equation ω = Sλ + x 2τ u, x 2τ u + Sλ = ω (2) x 2τ u I + Sv I = r I, (3) where u I, v I and r I are the Bezout coefficients returned by the REEA with input x 2τ and S, and I is the index determined by the conditions deg r I 1 τ and deg r I < τ. In particular, λ = v I g and ω = r I g for some g L[x; σ]. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (12)
46 Sugiyama-like decoding If (λ, ω) r = 1, then the last theorem gives that the REEA serves for the computation of the locator polynomial λ and the evaluator polynomial ω. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (13)
47 Sugiyama-like decoding If (λ, ω) r = 1, then the last theorem gives that the REEA serves for the computation of the locator polynomial λ and the evaluator polynomial ω. As mentioned above, once these polynomials are computed, the error polynomial is computed by a scheme similar to the Sugiyama algorithm for (commutative) RS codes. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (13)
48 Sugiyama-like decoding If (λ, ω) r = 1, then the last theorem gives that the REEA serves for the computation of the locator polynomial λ and the evaluator polynomial ω. As mentioned above, once these polynomials are computed, the error polynomial is computed by a scheme similar to the Sugiyama algorithm for (commutative) RS codes. The condition (λ, ω) r = 1 is equivalent to deg v I = Cardinal{0 i n 1 : 1 σ i (β)x left divides v I } GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (13)
49 Sugiyama-like decoding algorithm Input: A polynomial y = n 1 i=0 y ix i received from the transmission of a codeword c in a skew RS code C generated by g = [{x σ i (β)} i=0,...,n k 1 ] l of error-correcting capacity τ = n k 2. Output: A codeword c, or key equation failure. 1: for 0 i 2τ 1 do 2: S i n 1 j=0 y jn j (σ i (β)) 3: S 2τ 1 i=0 σi (α)s i x i 4: If S = 0 then 5: Return y 6: {u i, v i, r i } i=0,...,l REEA(x 2τ, S) 7: I first iteration in REEA with deg r i < τ, pos 8: for 0 i n 1 do 9: If 1 σ i (β)x is a left divisor of v I then 10: pos = pos {i} 11: If deg v I > Cardinal(pos) then 12: Return key equation failure 13: for j pos do 14: p j right-quotient(v I, 1 σ j (β)x) 15: Solve the linear system r I = j pos e jσ j (α)p j 16: e j pos e jx j 17: Return y e GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (14)
50 Key equation failures How often occurs the key equation failure? GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (15)
51 Key equation failures How often occurs the key equation failure? Well, it never happens if the error values are in general position. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (15)
52 Key equation failures How often occurs the key equation failure? Well, it never happens if the error values are in general position. More precisely, Theorem The key equation failure happens if and only if e 1,..., e ν are linearly dependent over K = L σ. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (15)
53 Key equation failures How often occurs the key equation failure? Well, it never happens if the error values are in general position. More precisely, Theorem The key equation failure happens if and only if e 1,..., e ν are linearly dependent over K = L σ. On the other hand, we have an algorithm to solve the key equation failure, if we insist. GLN (UGR) Skew RS codes NCRA V, June 14, 2017 (15)
Math 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 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 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 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 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 informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
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 informationSkew Cyclic Codes Of Arbitrary Length
Skew Cyclic Codes Of Arbitrary Length Irfan Siap Department of Mathematics, Adıyaman University, Adıyaman, TURKEY, isiap@adiyaman.edu.tr Taher Abualrub Department of Mathematics and Statistics, American
More informationOn Cyclic Convolutional Codes
On Cyclic Convolutional Codes Heide Gluesing-Luerssen and Wiland Schmale February 9, 2004 Abstract We investigate the notion of cyclicity for convolutional codes as it has been introduced in the papers
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 informationAlgebra Exam Topics. Updated August 2017
Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have
More informationAn Alternative Decoding Method for Gabidulin Codes in Characteristic Zero
An Alternative Decoding Method for Gabidulin Codes in Characteristic Zero Sven Müelich, Sven Puchinger, David Mödinger, Martin Bossert Institute of Communications Engineering, Ulm University, Germany IEEE
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 informationRings in Coding Theory
Rings in Coding Theory Steven T. Dougherty July 3, 2013 Cyclic Codes Cyclic Codes were first studied by Prange in 1957. Prange, E. Cyclic error-correcting codes in two symbols. Technical Note TN-57-103,
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 informationOn Syndrome Decoding of Chinese Remainder Codes
On Syndrome Decoding of Chinese Remainder Codes Wenhui Li Institute of, June 16, 2012 Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2012) Pomorie, Bulgaria Wenhui
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 informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationUNIT MEMORY CONVOLUTIONAL CODES WITH MAXIMUM DISTANCE
UNIT MEMORY CONVOLUTIONAL CODES WITH MAXIMUM DISTANCE ROXANA SMARANDACHE Abstract. Unit memory codes and in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial
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 information2a 2 4ac), provided there is an element r in our
MTH 310002 Test II Review Spring 2012 Absractions versus examples The purpose of abstraction is to reduce ideas to their essentials, uncluttered by the details of a specific situation Our lectures built
More information(Reprint of pp in Proc. 2nd Int. Workshop on Algebraic and Combinatorial coding Theory, Leningrad, Sept , 1990)
(Reprint of pp. 154-159 in Proc. 2nd Int. Workshop on Algebraic and Combinatorial coding Theory, Leningrad, Sept. 16-22, 1990) SYSTEMATICITY AND ROTATIONAL INVARIANCE OF CONVOLUTIONAL CODES OVER RINGS
More informationProjective modules: Wedderburn rings
Projective modules: Wedderburn rings April 10, 2008 8 Wedderburn rings A Wedderburn ring is an artinian ring which has no nonzero nilpotent left ideals. Note that if R has no left ideals I such that I
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 informationMATH 433 Applied Algebra Lecture 22: Review for Exam 2.
MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric
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 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 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 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 informationAn Interpolation Algorithm for List Decoding of Reed-Solomon Codes
An Interpolation Algorithm for List Decoding of Reed-Solomon Codes Kwankyu Lee Department of Mathematics San Diego State University San Diego, USA Email: kwankyu@sogangackr Michael E O Sullivan Department
More informationDecoding Interleaved Gabidulin Codes using Alekhnovich s Algorithm 1
Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory June 18-24, 2016, Albena, Bulgaria pp. 255 260 Decoding Interleaved Gabidulin Codes using Alekhnovich s Algorithm 1 Sven Puchinger
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 informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
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 informationGraduate Preliminary Examination
Graduate Preliminary Examination Algebra II 18.2.2005: 3 hours Problem 1. Prove or give a counter-example to the following statement: If M/L and L/K are algebraic extensions of fields, then M/K is algebraic.
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 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 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 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 informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
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 informationList of topics for the preliminary exam in algebra
List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.
More informationConstruction and Encoding of QC-LDPC Codes Using Group Rings
1 Construction and Encoding of QC-LDPC Codes Using Group Rings Hassan Khodaiemehr and Dariush Kiani arxiv:1701.00210v1 [cs.it] 1 Jan 2017 Abstract Quasi-cyclic (QC) low-density parity-check (LDPC) codes
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 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 informationGroup Ring Codes over a Dihedral Group ABSTRACT 1. INTRODUCTION
Malaysian Journal of Mathematical Sciences 9(S) June: 37-52 (2015) Special Issue: The 4 th International Cryptology and Information Security Conference 2014 (Cryptology 2014) MALAYSIAN JOURNAL OF MATHEMATICAL
More informationALGEBRA PH.D. QUALIFYING EXAM September 27, 2008
ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely
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 informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationQuadratic Forms. Marco Schlichting Notes by Florian Bouyer. January 16, 2012
Quadratic Forms Marco Schlichting Notes by Florian Bouyer January 16, 2012 In this course every ring is commutative with unit. Every module is a left module. Definition 1. Let R be a (commutative) ring
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 informationStrongly-MDS Convolutional Codes
Strongly-MDS Convolutional Codes Heide Gluesing-Luerssen Department of Mathematics University of Groningen P.O. Box 800 9700 AV Groningen, The Netherlands e-mail: gluesing@math.rug.nl Joachim Rosenthal
More informationA Matrix Ring Description for Cyclic Convolutional Codes
A Matrix Ring Description for Cyclic Convolutional Codes Heide Gluesing-Luerssen, Fai-Lung Tsang August 8, 2007 Abstract: In this paper, we study convolutional codes with a specific cyclic structure. By
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
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 informationOn the Construction and Decoding of Cyclic LDPC Codes
On the Construction and Decoding of Cyclic LDPC Codes Chao Chen Joint work with Prof. Baoming Bai from Xidian University April 30, 2014 Outline 1. Introduction 2. Construction based on Idempotents 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 information7 Orders in Dedekind domains, primes in Galois extensions
18.785 Number theory I Lecture #7 Fall 2015 10/01/2015 7 Orders in Dedekind domains, primes in Galois extensions 7.1 Orders in Dedekind domains Let S/R be an extension of rings. The conductor c of R (in
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
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 informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
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 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 informationCODE DECOMPOSITION IN THE ANALYSIS OF A CONVOLUTIONAL CODE
Bol. Soc. Esp. Mat. Apl. n o 42(2008), 183 193 CODE DECOMPOSITION IN THE ANALYSIS OF A CONVOLUTIONAL CODE E. FORNASINI, R. PINTO Department of Information Engineering, University of Padua, 35131 Padova,
More informationConstructions of MDS-Convolutional Codes
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 5, JULY 2001 2045 Constructions of MDS-Convolutional Codes Roxana Smarandache, Student Member, IEEE, Heide Gluesing-Luerssen, and Joachim Rosenthal,
More informationFILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.
FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0
More informationCodes over an infinite family of algebras
J Algebra Comb Discrete Appl 4(2) 131 140 Received: 12 June 2015 Accepted: 17 February 2016 Journal of Algebra Combinatorics Discrete tructures and Applications Codes over an infinite family of algebras
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 informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More information4 Etale algebras, norm and trace
18.785 Number theory I Fall 2017 Lecture #4 09/18/2017 4 Etale algebras, norm and trace 4.1 Separability In this section we briefly review some standard facts about separable and inseparable field extensions
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 informationGeneral error locator polynomials for binary cyclic codes with t 2 and n < 63
General error locator polynomials for binary cyclic codes with t 2 and n < 63 April 22, 2005 Teo Mora (theomora@disi.unige.it) Department of Mathematics, University of Genoa, Italy. Emmanuela Orsini (orsini@posso.dm.unipi.it)
More informationNoetherian property of infinite EI categories
Noetherian property of infinite EI categories Wee Liang Gan and Liping Li Abstract. It is known that finitely generated FI-modules over a field of characteristic 0 are Noetherian. We generalize this result
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 information55 Separable Extensions
55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple
More informationSynthetic Geometry. 1.4 Quotient Geometries
Synthetic Geometry 1.4 Quotient Geometries Quotient Geometries Def: Let Q be a point of P. The rank 2 geometry P/Q whose "points" are the lines of P through Q and whose "lines" are the hyperplanes of of
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 informationPartial Permutation Decoding for abelian codes
1 Partial Permutation Decoding for abelian codes José Joaquín Bernal Juan Jacobo Simón Abstract In [3], we introduced a technique to construct an information set for every semisimple abelian code over
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
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 informationQUATERNIONS AND ROTATIONS
QUATERNIONS AND ROTATIONS SVANTE JANSON 1. Introduction The purpose of this note is to show some well-known relations between quaternions and the Lie groups SO(3) and SO(4) (rotations in R 3 and R 4 )
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 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 informationThus, the integral closure A i of A in F i is a finitely generated (and torsion-free) A-module. It is not a priori clear if the A i s are locally
Math 248A. Discriminants and étale algebras Let A be a noetherian domain with fraction field F. Let B be an A-algebra that is finitely generated and torsion-free as an A-module with B also locally free
More informationCodes and Rings: Theory and Practice
Codes and Rings: Theory and Practice Patrick Solé CNRS/LAGA Paris, France, January 2017 Geometry of codes : the music of spheres R = a finite ring with identity. A linear code of length n over a ring R
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 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 informationConstruction of quasi-cyclic self-dual codes
Construction of quasi-cyclic self-dual codes Sunghyu Han, Jon-Lark Kim, Heisook Lee, and Yoonjin Lee December 17, 2011 Abstract There is a one-to-one correspondence between l-quasi-cyclic codes over a
More informationSome aspects of codes over rings
Some aspects of codes over rings Peter J. Cameron p.j.cameron@qmul.ac.uk Galway, July 2009 This is work by two of my students, Josephine Kusuma and Fatma Al-Kharoosi Summary Codes over rings and orthogonal
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 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 informationMINKOWSKI THEORY AND THE CLASS NUMBER
MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the
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 informationLinear Codes, Target Function Classes, and Network Computing Capacity
Linear Codes, Target Function Classes, and Network Computing Capacity Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth Zeger IEEE Transactions on Information Theory Submitted:
More informationMessage Encoding and Retrieval for Spread and Cyclic Orbit Codes
Message Encoding and Retrieval for Spread and Cyclic Orbit Codes Anna-Lena Trautmann, Member, IEEE Department of Electrical and Electronic Engineering University of Melbourne, Australia Department of Electrical
More informationRUDIMENTARY GALOIS THEORY
RUDIMENTARY GALOIS THEORY JACK LIANG Abstract. This paper introduces basic Galois Theory, primarily over fields with characteristic 0, beginning with polynomials and fields and ultimately relating the
More informationALGEBRA QUALIFYING EXAM PROBLEMS
ALGEBRA QUALIFYING EXAM PROBLEMS Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND MODULES General
More informationREED-SOLOMON CODE SYMBOL AVOIDANCE
Vol105(1) March 2014 SOUTH AFRICAN INSTITUTE OF ELECTRICAL ENGINEERS 13 REED-SOLOMON CODE SYMBOL AVOIDANCE T Shongwe and A J Han Vinck Department of Electrical and Electronic Engineering Science, University
More informationCourse of algebra. Introduction and Problems
Course of algebra. Introduction and Problems A.A.Kirillov Fall 2008 1 Introduction 1.1 What is Algebra? Answer: Study of algebraic operations. Algebraic operation: a map M M M. Examples: 1. Addition +,
More informationSuperregular Hankel Matrices Over Finite Fields: An Upper Bound of the Matrix Size and a Construction Algorithm
University of Zurich Institute of Mathematics Master s Thesis Superregular Hankel Matrices Over Finite Fields: An Upper Bound of the Matrix Size and a Construction Algorithm Author: Isabelle Raemy Supervisor:
More information