General error locator polynomials for nth-root codes
|
|
- Bryan Franklin
- 5 years ago
- Views:
Transcription
1 General error locator polynomials for nth-root codes Marta Giorgetti 1 and Massimiliano Sala 2 1 Department of Mathematics, University of Milano, Italy 2 Boole Centre for Research in Informatics, UCC Cork, Ireland Abstract. All interesting linear codes (i.e., with d 2) form a class, called nth-root codes. We investigate the decoding for an interesting subclass, proving the existence of general error locator polynomials. 1 Introduction We introduce a class of linear codes called n-th root codes, that essentially includes all linear codes (as soon as their minimum distance is greater than or equal to two). Those codes are defined by means of their parity-check matrix, the expression of which generalizes the one for cyclic codes. In [8] the notation of general error locator polynomials for correctable linear codes was introduced. These are multivariable polynomials such that their specializations (to a correctable syndrome s) give the error locations (corresponding to s). We exhibit a subclass of linear codes for which general error locator polynomials do exist. To do so, we construct an ideal involving the polynomials defining the parity-check matrix of a (proper maximal zerofree) n-th root code. We investigate properties of this ideal and show that its totally reduced Gröbner basis contains a (unique) general error locator polynomial. In the same spirit, we show the existence of general locator polynomials of type ν - handling errors and erasures - for such codes. 2 Preliminaries We denote by F q the finite field with q elements, where q is a power of a prime, and by n a natural number such that q and n are relatively prime. Let k, N N such that 1 k N n + 1. We refer to the vector space of dimension N over F q as to (F q ) N. The zeros of polynomial x n 1, which are called n-th roots of unity, lie in an extension field F q m and in no smaller field. We denote the set of all these roots by R n. From now on, q,n, k, N and m are understood. All the following statements and definitions can be found in [5] and [4], unless otherwise stated.
2 2.1 General error locator polynomial Let C be an [N, k, d] code over F q, t its correction capability and H a paritycheck matrix over F q m. Let d 3. The syndromes lie in (F q m) N k and form a vector space of dimension (N k) over F q. Let α be a primitive N-th root of unity in F q m, so that n = N. Let r = N k. Definition 1 ([8]). Let L C be a polynomial in F q [X, z], where X = (x 1,..., x r ). Then L C is a general error locator polynomial of C if 1. L C (X, z) = z t + a t 1 z t a 0, with a j F q [X], 0 j t 1, that is, L C is a monic polynomial with degree t with respect to the variable z and its coefficients are in F q [X]; 2. given a syndrome s = (s 1,... s r ) (F q m) N k, corresponding to a vector error of weight µ t and error locations {k 1,..., k µ }, if we evaluate the X variables in s, then the roots of L C (s, z) are {α k1,..., α kµ, 0,..., 0}. }{{} t µ Definition 2 ([8]). Let L be a polynomial in F q [X, W, z], X = (x 1,..., x r ) and W = (w ν,..., w 1 ), where ν 1 is the number of erasures that occurred. Then L is a general error locator polynomial of type ν of C if 1. L(X, W,z) = z τ + a τ 1 z τ a 0, with a j F q [X, W ], for any 0 j τ 1, that is, L is a monic polynomial with degree τ in the variable z and coefficients in F q [X, W ]; 2. for any syndrome s = (s 1,..., s r ) and any erasure location vector w= (w 1,..., w ν ), corresponding to an error of weight µ τ and error locations {k 1,..., k µ }, if we evaluate the X variables in s and the W variables in w, then the roots of L(s, w, z) are {α k1,..., α kµ, 0,..., 0}. }{{} τ µ If such L exists for a given code C, then we name the polynomial L ν C. We denote by L 0 C polynomial L C. For a code C, the possession of a general locator polynomial L ν C of type ν for all 0 ν < d might be a stronger condition than the possession of a general error locator polynomial L C, but in [8] the authors prove that any cyclic code admits a general locator polynomial of type ν, for 0 ν < d. 2.2 Definition and first properties of nth-root codes Definition 3. Let L R n {0}, L = {l 1,..., l N } and P= {g 1 (x),..., g r (x)} in F q m[x] such that i = 1,..., N there is at least one j = 1,..., r such that g j (l i ) 0. We denote by C = Ω(q, n, q m, L, P) the linear code defined over F q having g 1 (l 1 )... g 1 (l N ) g 1 (L) g 2 (l 1 )... g 2 (l N ) g 2 (L) H =.. = g r (l 1 )... g r (l N ). g r (L)
3 as its parity-check matrix. We say that C is an nth-root code. Remark 1. Code C = Ω(q, n, q m, L, P) is linear over F q, its length is N = L and its distance d is greater than or equal to 2, because there are no columns in H composed only of zeros. If 0 L we assume l N = 0 (any re-ordering of L gives an equivalent code). Definition 4. Let C = Ω(q, n, q m, L, P) be an nth-root code. If L = R n \ L =, we say that C is maximal. If P F q [x], we say that C is proper. If 0 / L, we say that C is zerofree, non-zerofree otherwise. Since any function from F q m to itself can be expressed as a polynomial, we can accept in P also rational functions of type f/g, f, g F q m, such that g( x) 0 for any x F q m. We do so from now on, without further comments. Example 1. Let q = 2, n = 7, q m = 8, L = F 2 3 = β {0}, the minimal polynomial of β is z z + 1, and P= {g 1 (x) = x 2 +x+1, g x 2(x) = x 2 +x+1 }. The seven 7th roots of unity are all the elements of F 8, R 7 = F 8. The nth-root code C = Ω(2, 7, 8, F 8, {g 1, g 2 }) is non-zerofree (0 L), maximal and it is easy to see that C is an [8,2,5] code. Remark 2. In order to define the same nth-root code, it is possible to use different n. For example, to define an nth-root code with length N = 5, we can use the five 5th roots of unity or five 7th roots of unity. Proposition 1. Let C be a linear code over F q of length N and d 2. Then C is an nth-root code for any n N 1 such that (n, q) = 1. In particular: 1. if n = N, then C can be maximal zerofree, 2. if n = N 1, then C is maximal non-zerofree. Corollary 1. Let C be a linear code. C is an nth-root code if and only if d 2. 3 General error locator polynomial 3.1 Application of the Gianni-Kalkbrener Theorem Let K be a (not necessarily finite) field. Assume G is a Gröbner basis for a 0 dimensional ideal J K[S, A, T ], S = (s 1,..., s H ), A = (a 1,..., a L ), T = (t 1,..., t M ) w.r.t. a order with S < A < T and with the A variables lexicographically ordered by a 1 > a 2 >... > a L. Then the elements of set G (K[S, A] \ K[S]) can be collected into blocks {G i } 1 i L : G 1 = {g 1,1 (S, a L,..., a 1 ),..., g 1,l1 (S, a L,..., a 1 )}, G 2 = {g 2,1 (S, a L,..., a 2 ),..., g 2,l2 (S, a L,..., a 2 )},. G L = {g L,1 (S, a L ),..., g L,lL (S, a L )},
4 in such a way that: for any i, G i K[S, a L,..., a i+1 ][a i ] \ K[S, a L,..., a i+1 ], the ideal generated by j>i G j is actually the i-th elimination ideal J i, J i = J K[S, a L,..., a i ]. The Gianni-Kalkbrener Theorem [3] ensures that G i for 1 i L. Clearly any G i, 1 i L, can be decomposed into blocks of polynomials according to their degree with respect to the variable a i : G i = i δ=1 G iδ, but some G iδ could be empty. In this way, if g G iδ, we have: g K[S, a L,..., a i+1 ][a i ] \ K[S, a L,..., a i+1 ], deg ai (g) = δ, i.e. g = ba δ i + and b = Lp(g) K[S, a L,..., a i+1 ]. Let N iδ be the number of elements of G iδ. We name the elements of set G iδ = {g iδj, 1 j N iδ } according to their order: h < j Lt(g iδh ) < Lt(g iδj ). Remark 3. We can summarize our description. Given any two polynomials g ldh G ld and g iδj G iδ, then l > i or g ldh < g iδj Lt(g ldh ) < Lt(g iδj ) l = i, D < δ or l = i, D = δ, h < j Since J is 0 dimensional, we can clearly decompose the variety of its elimination ideals as follows. Let J S = J K[S], J S {al } = J K[S, a L ],..., J S {al,...,a 1} = J K[S, a L,..., a 1 ] = J K[S, A]. We have: 1) V(J S ) = λ(l) j=1 ΣL j, with Σ L j = {(s 1,..., s N ) V(J S ) there are exactly j values {ā (1) L,..., ā(j) L }, s.t.(s 1,..., s N, ā (i) L ) V(J S {a L }), 1 i j}; 2) V(J S {al }) = λ(l 1) Σ L 1 j j=1 Σ L 1 j,with = {(s 1,..., s N, a L ) V(J S {al }) there are exactly j values {ā (1) L 1,..., ā(j) L 1 }, s.t.(s 1,..., s N, a L, ā (i) L 1 ) V(J S {a L,a L 1 }), 1 i j}; 3) V(J S {al,...,a h }) = λ(h 1) Σ h 1 j j=1 Σ h 1 j, 2 h L with = {(s 1,..., s N, a L,..., a h ) V(J S {al,...,a h }) exactly j values {ā (1) h 1,..., ā(j) h 1 }, s.t.(s 1,..., s N, a L,..., a h, ā (i) h 1 ) V(J S {a L,...,a h+1 }), 1 i j}; (1)
5 Note that, for a general 0-dimensional ideal J, nothing can be said about λ(h), except that λ(h) 1 for any 2 h L. We now introduce a class of ideals which are very useful in our context. Definition 5. With the above notation we say that J is stratified if: 1. λ(h) = h, 1 h L and 2. h j, 1 h L, 1 j h. Example 2. Let S = {s 1 }, A = {a 1, a 2 } (so that L = 2) and T = {t 1 } such that S < A < T and a 1 > a 2. Let K = C and J be the ideal in C[s 1, a 1, a 2, t 1 ] generated by: {s 2 1 s 1, a 2 3, a 1 s 1 2s 1, a a 1 s 1 3a 1 2s 1 + 2, t 1 }. The variety of J is V(J) = {(0, 1, 3, 0), (0, 2, 3, 0), (1, 2, 3, 0)}. Let J S = J C[S] = s 2 1 s 1, then V(J S ) = J S = λ(l) L j=1 j = 2 λ(2) j=1 j = {0, 1}. Clearly {1} = 2 1, which means λ(2) = 2 satisfying condition (1) in Definition 5, for h = 1, 2. Variety V(J S {a2}) = λ(l 1) λ(1) j=1 j = {(0, 1), (0, 2), (1, 2)}. Clearly {(0, 1), (0, 2), (1, 2)} = 1 1 which means λ(l 1) = λ(1) = 1 satisfying condition (1) and all i j, i, j = 1, 2, are not empty, so that ideal J is stratified. See Figure 1 (A) and (B). and {0} = 2 3 Theorem 1. Let J be a radical stratified ideal, then for 1 i L, G i = i δ=1g iδ, with G iδ, 1 δ i and 1 i L. Moreover 1 i L, G ii = {g ii1 }, i.e. only one polynomial exists in G i with degree i w.r.t. a i ; 1 i L, Lp(g ii1 ) = 1, Lt(g ii1 ) = a i i. 3.2 Ideals for the decoding of nth-root codes Definition 6. Let C = Ω(q, n, q m, L, P) be a zerofree maximal nth-root code, with correction capability t. We denote by J C,t the ideal J C,t F q m[x 1,..., x r, z t,..., z 1, y 1,..., y t ], { t } { } J C,t = h=1 y hg s (z h ) x s, y q 1 j 1, 1 s r 1 j t {z i z j p(z i, z j )} i j, 1 i,j t, { zj n z } (2) j 1 j t where p(x, y) = n 1 h=0 xh y n 1 h. We denote by G C,t the totaly reduced Gröbner basis of J C,t w.r.t. >. Note that variables x 1,..., x r represent correctable syndromes, z 1,..., z t error locations and y 1,..., y t error values.
6 5 a 2 (A) a (B) s (1,0) (2,0) (2,1) (a,s ) 2 1 Fig. 1. Varieties in a stratified case. Lemma 1. Ideal J C,t is radical and stratified. Applying Theorem 1 to J C,t (and Lemma 1), we have the following proposition. Proposition 2. In Gröbner basis G C,t there exists a unique polynomial of type g = z t t + a t 1 z t 1 t We now state the main result of this paper a 0, a i F q m[x]. Theorem 2. If code C is a proper maximal zerofree nth-root code with correction capability t, then C possesses a general error locator polynomial. Since cyclic codes are proper maximal zerofree nth-root codes we obtain, as a special case of Theorem 2, that cyclic codes have general error locator polynomials (Theorem 6.9 in [8]). From now on we often shorten general error locator polynomial to OS polynomial. In the next two examples we show two methods to compute OS polynomials. The former is suggested by Proposition 2. In the latter we assume we know that a general error locator polynomial exists for the code and hence we apply directly Definition 1. Example 3. Let G and H be following binary matrices ( ) G = H =
7 Let C be the [5, 2, 3] linear code over F 2 with G as a generator matrix and H as a parity-check matrix. Note t = 1. Let γ be a primitive element of F 16 with minimal polynomial z 4 + z + 1. Then C is the zerofree maximal nth-root code Ω(2, 5, 2 4, R 5, P), where P = { g 1 (x) = γ 4 x 4 + γ 8 x 3 + γ 2 x 2 + γx + 1, g 2 (x) = γ 10 x 4 + γ 5 x 3 + γ 5 x 2 + γ 10 x + 1, g 3 (x) = γ 11 x 4 + γ 7 x 3 + γ 13 x 2 + γ 14 x}. We construct ideal J C,t F 16 [x 1, x 2, x 3, z 1 ] = F 16 [X, Z], as follows: J C,1 = {g h (z 1 ) x h } 1 h 3, z n 1 z 1. If we calculate Gröbner basis G C,t = G X G X,z1 induced by x 1 < x 2 < x 3 < z 1, we obtain: w.r.t. the lexicographical order G X = {x x 3, x x 2, x 1 x 3 + x 2 x 3, x 1 x 2 + x 1 + x 2 x 3 + x 2 + x 3 + 1, x x 1 } and G X,z1 = {g 111 = z 1 + (γ 2 +γ)x 1 + (γ 3 +γ)x 2 x 3 + γx 2 + x 3 + (γ 3 +γ 2 +γ)}. In G X,z1 there is only one polynomial in z 1 of degree 1, as we expected, g 111, and it must be an OS polynomial for C thanks to Fact 2. Example 4. Let C be the code in Example 3. Another way to compute an OS polynomial is to see code C with parity-check matrix H = (γ 6, γ 2, γ 3, γ 14, 1), so that C = Ω(2, 5, 2 4, R 5, P ), where P = {γ 12 x 4 + γ 11 x 3 + x 2 + γ 14 x + γ 3 }. If we calculate the Gröbner basis G w.r.t. the lexicographical order induced by x 1 < z 1, its elements are: G x 1 = x (γ 3 )x (γ 3 + γ)x γ 2 x 1 + (γ 2 + γ + 1), G x 1,z 1 = z 1 + x 3 1. There is only one polynomial in z 1 of degree 1, as we expected, and it is another OS polynomial for C. Example 5. Another way to compute OS polynomials for a code is to suppose that those polynomials exist. Let C be the code studied in Example 3. We assume that its parity-check matrix is a row, H = (e 1, e 2, e 3, e 4, e 5 ). We search for an OS polynomial z + f(x) (the degree t of z is 1). It must satisfy the following conditions: f(e i ) = α i, 1 i 5, and f(0) = 0. Polynomial f(x) has degree at most 5 with coefficients b i in F 2, so that we can write f(x) = b 5 x 5 + b 4 x 4 + b 3 x 3 + b 2 x 2 + b 1 x (f(0) = 0 b 0 = 0). We compute a Gröbner basis of ideal J F 16 [b 1, b 2, b 3, b 4, b 5, e 2, e 3, e 5 ] given by J = e 1 + e 2 + e 3, e 3 + e 4 + e 5, {e 15 i + 1} 1 i 5, {b 2 i + b i} 1 i 5, f(e 1 ) + γ 3, f(e 2 ) + γ 6, f(e 3 ) + γ 9, f(e 4 ) + γ 12, f(e 5 ) + γ 15
8 where relations e 1 = e 2 + e 3, e 4 = e 3 + e 5 follow from matrix G. We obtain e 1 = γ 6, e 2 = γ 2, e 3 = γ 3, e 4 = γ 14, e 5 = 1, so that the parity-check matrix is H = (γ 6, γ 2, γ 3, γ 14, 1) and the OS polynomial is f(x) = x 3. We note that it is the same as in Example 4. Remark 4. The previous example is interesting because we have simultaneously computed for C an nth-root presentation and a general error locator polynomial. The nice shape of the general error locator polynomial reveals an unexpected structure in this code. If the approach presented in Example 5 fails for a code C, that is, if V(J) =, then it means that C does not possess an OS polynomial for any nth-root presentation such that H is composed of one row. However, it could be that C possesses an OS polynomial for H with up to N k rows. We think that it is obvious how this may be checked with a similar commutative algebra approach, and so we do not detail it. Example 6. Consider the nth-root code of Example 1, shortened in position 0. It is a classical Goppa code with g(x) = x 2 + x + 1 and L = F 8. An OS polynomial for this code is L = z z 2 (x 5 1x x x 3 1x x x 2 1x x 2 1x 2 + x 1 x x 1 x x 1 x 3 2+ x 1 x x 1 x 2 + x 1 + x x x x ) + x 5 1x x 5 1x 2 + x x 4 1x 2 2+ x 3 1x x 2 1x 2 + x x 1 x x 1 x 2 + x 1 + x x Extended syndrome variety We extend previous results to the case when there are also erasures. Let τ be a natural number corresponding to the number of errors, µ be a natural number corresponding to the number of erasures and such that 2τ + µ < d. We have to find solutions of equations of type: s j + τ a l g j (α k l ) + l=1 ν l=1 c lg j (α h l ), j = 1,..., r (3) where {k l }, {a l } and {c l} are unknown and { s j }, {h l} are known. We introduce variables W = (w ν,..., w 1 ) and U = (u 1,..., u ν ), where the {w h } stand for erasure locations (α h l ) and the {uh } stand for erasure values c l (h = 1,..., ν). When the word v(x) is received, the number ν of erasures and their positions {w h } are known. We rewrite equations (3) in terms of X, Y, Z, W and U, where the {x j } stand for the syndromes (j = 1,..., r), as: J C,τ,ν = { τ l=1 y lg j (z l ) + ν l u lg j (w l) x j } j=1,...,r,, {z n+1 i z i } i=1,...,τ, {y q 1 i 1} i=1,...,τ, {u q h u h} h=1,...,ν, {wh n 1} h=1,...,ν, {x qm j x j } j=1,...,r, {p(w h, w k )} h k,h,k=1,...,ν, {z i p(z i, w h )} i=1,...,τ,h=1,...,ν, {z i z j p(z i, z j )} i j,i,j=1,...,τ.
9 We observe that: - polynomials τ l=1 y lg j (z l ) + ν l u lg j (w l) x j characterize the nth-root code; - polynomials z n+1 i z i ensure that z i are nth-roots of unity or 0; - polynomials y q 1 i 1, wh n 1, uq h u h ensure that y i, w h F q and u h F q ; - polynomials z i p(z i, w h ) ensure that an error cannot occur in a position corresponding to an erasure; - polynomials p(w h, w k ) ensure that any two erasure locations are distinct; - polynomials z i z j p(z i, z j ) ensure that any two error locations are distinct. Ideal J C,τ,ν depends only on code C and on ν. Proposition 3. In Gröbner basis G C,τ,ν there is a unique polynomial of type g = z τ τ + a τ 1 z τ a 0, a i F q m[x, W ]. Theorem 3. If code C is a proper maximal zerofree nth-root code, then C possesses general error locator polynomials of type ν, for any ν 0. Example 7. Let C be the shortened code obtained from code C presented in Example 1. Code C is a [7, 1, 6] linear code, so that τ (errors) and µ (erasures) satisfy relation τ + µ < 6. If τ = 1, µ = 2, the syndrome ideal is J = {g 1 (z 1 ) + u 1 g 1 (w 1 ) + u 2 g(w 2 ) + x 1, g 2 (z 1 ) + u 1 g 2 (w 1 ) + u 2 g 2 (w 2 ) + x 2, z 8 1 z 1, w 7 1 1, w 7 2 1, x 8 1 x 1, x x 2, u u 1, u u 2, z 1 p(z 1, w 1 ), z 1 p(z 1, w 2 ), p(w 1, w 2 )} and in the reduced Gröbner basis there is only one polynomial having z 1 as leading term (see Appendix of [5]). 4 Conclusions and further research Linear codes are traditionally specified starting from a parity-check matrix H. In particular, cyclic codes are such that the entries of H consist of the evaluation of univariate monomials on all the n-th roots of unity. Our approach is to specify any linear code (with d 2) as a code such that the entries of H consist of the evaluation of generic (univariate) polynomials on all the n-th roots of unity. In this sense, we say that linear codes are a generalization of cyclic codes. This point of view allows to extend to linear codes some computational algebra techniques and some argument, that have been previously applied to cyclic codes ([6],[7],[8]). This translates in new tools, but also in new challenges. In particular, we can identify a new decoding algorithm for a (potentially very large) sub-class, via the general error locator polynomial. The problem of decoding linear codes is NP-hard ([1], [2]), but if a linear code admits a sparse general error locator polynomial (or such a polynomial with a sparse representation), then it can be decoded very fast ([9]). We have provided an explicit example when the locator polynomial is very small, given a certain nth-root presentation, and large when given another.
10 Acknowledgments The first author would like to thank the second author (her supervisor). The authors would like to thank the following people for their comments and suggestions: J. Abbot, M. Bardet, F. Caruso, F. Dalla Volta, J. C. Faugere, P. Fitzpatrick, T. Mora, E. Orsini, M. Pellegrini, L. Perret, I. Simonetti, C. Traverso. We have run our computer simulations using the software package Singular ( at the computational centre MEDICIS ( This work has been partially supported by the STMicroelectronics contract Complexity issues in algebraic Coding Theory and Cryptography. References 1. A. Barg, Complexity issues in coding theory, Handbook of coding theory, Vol. I, II, p , North-Holland, Amsterdam, A. Barg, E. Krouk, H. C. A. van Tilborg, On the complexity of minimum distance decoding of long linear codes, IEEE Trans. Inform. Theory, vol. 45, 1999, no. 5, p M. Caboara, T. Mora, The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Groebner shape theorem, Applicable Algebra in Engineering, Communication and Computing, vol. 13, 2002, no. 3, p M. Giorgetti, On some algebraic interpretation of classical codes, PhD Thesis, University of Milan, M. Giorgetti, M. Sala, A commutative algebra approach to linear codes, UCC- BCRI preprint, 58, M. Sala, Groebner basis techniques to compute weight distributions of shortened cyclic codes, Journal of Algebra and Its Applications, vol. 6, no. 2, M. Sala, Groebner bases and distance of cyclic codes, Applicable Algebra in Engineering, Communication and Computing, vol. 13, 2002, no. 2, p E. Orsini, M. Sala, Correcting errors and erasures via the syndrome variety, Journal of Pure and Applied Algebra, vol. 200, 2005, no. 1-2, p E. Orsini, M. Sala, General error locator polynomials for binary cyclic codes with t 2 and n < 63, IEEE Trans. Inform. Theory, vol. 53, 2007, no. 3, p
A commutative algebra approach to linear codes
A commutative algebra approach to linear codes Marta Giorgetti (giorge@mat.unimi.it) Department of Mathematics, University of Milano, Italy. Massimiliano Sala (msala@bcri.ucc.ie) Boole Centre for Research
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 informationGroebner basis techniques to compute weight distributions of shortened cyclic codes
Groebner basis techniques to compute weight distributions of shortened cyclic codes 2nd February 2007 Massimiliano Sala (msala@bcri.ucc.ie) Boole Centre for Research in Informatics, UCC Cork, Ireland.
More informationA classification of MDS binary systematic codes
A classification of MDS binary systematic codes Eleonora Guerrini (guerrini@science.unitn.it) Department of Mathematics, University of Trento, Italy. Massimiliano Sala (msala@bcri.ucc.ie) Boole Centre
More informationOn the Weight Distribution of N-th Root Codes
Fabrizio Caruso Marta Giorgetti June 10, 2009 The Recurrence Proof by Generating Functions A Computer-Generated Proof Computing Some Steps of the Recurrence A Computer-Provable Identity Proving the Guessed
More informationInteresting Examples on Maximal Irreducible Goppa Codes
Interesting Examples on Maximal Irreducible Goppa Codes Marta Giorgetti Dipartimento di Fisica e Matematica, Universita dell Insubria Abstract. In this paper a full categorization of irreducible classical
More informationA theory for the distance of cyclic codes
A theory for the distance of cyclic codes (msala@bcri.ucc.ie) Boole Centre for Research in Informatics, UCC Cork, Ireland (Part of this work is jointly with E. Betti and F. Ponchio) Workshop D1: Gröbner
More informationComputing Minimal Polynomial of Matrices over Algebraic Extension Fields
Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 2, 2013, 217 228 Computing Minimal Polynomial of Matrices over Algebraic Extension Fields by Amir Hashemi and Benyamin M.-Alizadeh Abstract In this
More informationON THE GRÖBNER BASIS OF A FAMILY OF QUASI-CYCLIC LDPC CODES. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol 31 No 2 (2005), pp 13-32 ON THE GRÖBNER BASIS OF A FAMILY OF QUASI-CYCLIC LDPC CODES MARTA GIORGETTI*, MARTA ROSSI AND MASSIMILIANO SALA Abstract In [30]
More informationOn formulas for decoding binary cyclic codes
On formulas for decoding binary cyclic codes Daniel Augot INRIA-Rocquencourt Domaine de Voluceau Le Chesnay, FRANCE Magali Bardet Laboratoire LITIS Université de Rouen Jean-Charles Faugère INRIA Rocquencourt,
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 informationConstruction of a Class of Algebraic-Geometric Codes via Gröbner Bases
MM Research Preprints, 42 48 No. 16, April 1998. Beijing Construction of a Class of Algebraic-Geometric Codes via Gröbner Bases Changyan Di, Zhuojun Liu Institute of Systems Science Academia Sinica, Beijing
More informationAlternant and BCH codes over certain rings
Computational and Applied Mathematics Vol. 22, N. 2, pp. 233 247, 2003 Copyright 2003 SBMAC Alternant and BCH codes over certain rings A.A. ANDRADE 1, J.C. INTERLANDO 1 and R. PALAZZO JR. 2 1 Department
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 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 informationDecoding error-correcting codes with Gröbner bases
Decoding error-correcting codes with Gröbner bases Stanislav Bulygin Technical University of Kaiserslautern Department of Mathematics P.O. Box 3049, 67653 Kaiserslautern Germany bulygin@mathematik.uni-kl.de
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 informationCode-Based Cryptography McEliece Cryptosystem
Code-Based Cryptography McEliece Cryptosystem I. Márquez-Corbella 0 . McEliece Cryptosystem 1. Formal Definition. Security-Reduction Proof 3. McEliece Assumptions 4. Notions of Security 5. Critical Attacks
More informationGeneralized Reed-Solomon Codes
Chapter 5 Generalized Reed-Solomon Codes In 1960, I.S. Reed and G. Solomon introduced a family of error-correcting codes that are douly lessed. The codes and their generalizations are useful in practice,
More information4 Hilbert s Basis Theorem and Gröbner basis
4 Hilbert s Basis Theorem and Gröbner basis We define Gröbner bases of ideals in multivariate polynomial rings and see how they work in tandem with the division algorithm. We look again at the standard
More informationCounting and Gröbner Bases
J. Symbolic Computation (2001) 31, 307 313 doi:10.1006/jsco.2000.1575 Available online at http://www.idealibrary.com on Counting and Gröbner Bases K. KALORKOTI School of Computer Science, University of
More informationALGEBRAIC GROUPS J. WARNER
ALGEBRAIC GROUPS J. WARNER Let k be an algebraically closed field. varieties unless otherwise stated. 1. Definitions and Examples For simplicity we will work strictly with affine Definition 1.1. An algebraic
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 informationbut no smaller power is equal to one. polynomial is defined to be
13. Radical and Cyclic Extensions The main purpose of this section is to look at the Galois groups of x n a. The first case to consider is a = 1. Definition 13.1. Let K be a field. An element ω K is said
More informationarxiv: v1 [math.gr] 10 Jun 2008
arxiv:0806.763v [math.gr] 0 Jun 2008 Permutation equivalent maximal irreducible Goppa codes Francesca Dalla Volta, Marta Giorgetti, Massimiliano Sala June 0, 2008 Abstract We consider the problem of finding
More informationPolynomials as Generators of Minimal Clones
Polynomials as Generators of Minimal Clones Hajime Machida Michael Pinser Abstract A minimal clone is an atom of the lattice of clones. A minimal function is a function which generates a minimal clone.
More informationOn the BMS Algorithm
On the BMS Algorithm Shojiro Sakata The University of Electro-Communications Department of Information and Communication Engineering Chofu-shi, Tokyo 182-8585, JAPAN Abstract I will present a sketch of
More informationOn the Griesmer bound for nonlinear codes
On the Griesmer bound for nonlinear codes Emanuele Bellini, Alessio Meneghetti To cite this version: Emanuele Bellini, Alessio Meneghetti. On the Griesmer bound for nonlinear codes. Pascale Charpin, Nicolas
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 informationComputation of the Minimal Associated Primes
Computation of the Minimal Associated Primes Santiago Laplagne Departamento de Matemática, Universidad de Buenos Aires Buenos Aires, Argentina slaplagn@dm.uba.ar Abstract. We propose a new algorithm for
More informationOn the Gröbner basis of a family of quasi-cyclic LDPC codes
On the Gröbner basis of a family of quasi-cyclic LDPC codes July 21, 2005 Marta Giorgetti (giorge@matunimiit) Department of Mathematics, University of Milan, Italy Marta Rossi (martarossi@possodmunipiit)
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationBounding the number of affine roots
with applications in reliable and secure communication Inaugural Lecture, Aalborg University, August 11110, 11111100000 with applications in reliable and secure communication Polynomials: F (X ) = 2X 2
More informationGroebner Bases in Boolean Rings. for Model Checking and. Applications in Bioinformatics
Groebner Bases in Boolean Rings for Model Checking and Applications in Bioinformatics Quoc-Nam Tran, Ph.D. Professor of Computer Science Lamar University Invited Talk at CMU on October 8, 2010 Outline
More informationCode-Based Cryptography Error-Correcting Codes and Cryptography
Code-Based Cryptography Error-Correcting Codes and Cryptography I. Márquez-Corbella 0 1. Error-Correcting Codes and Cryptography 1. Introduction I - Cryptography 2. Introduction II - Coding Theory 3. Encoding
More informationIntegral Extensions. Chapter Integral Elements Definitions and Comments Lemma
Chapter 2 Integral Extensions 2.1 Integral Elements 2.1.1 Definitions and Comments Let R be a subring of the ring S, and let α S. We say that α is integral over R if α isarootofamonic polynomial with coefficients
More information9. Integral Ring Extensions
80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications
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 informationMIT Algebraic techniques and semidefinite optimization February 16, Lecture 4
MIT 6.972 Algebraic techniques and semidefinite optimization February 16, 2006 Lecture 4 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture we will review some basic elements of abstract
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 information2 EBERHARD BECKER ET AL. has a real root. Thus our problem can be reduced to the problem of deciding whether or not a polynomial in one more variable
Deciding positivity of real polynomials Eberhard Becker, Victoria Powers, and Thorsten Wormann Abstract. We describe an algorithm for deciding whether or not a real polynomial is positive semidenite. The
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 informationA distinguisher for high-rate McEliece Cryptosystems
A distinguisher for high-rate McEliece Cryptosystems JC Faugère (INRIA, SALSA project), A Otmani (Université Caen- INRIA, SECRET project), L Perret (INRIA, SALSA project), J-P Tillich (INRIA, SECRET project)
More informationEfficient algorithms for finding the minimal polynomials and the
Efficient algorithms for finding the minimal polynomials and the inverses of level- FLS r 1 r -circulant matrices Linyi University Department of mathematics Linyi Shandong 76005 China jzh108@sina.com Abstract:
More informationOn the centre of the generic algebra of M 1,1
On the centre of the generic algebra of M 1,1 Thiago Castilho de Mello University of Campinas PhD grant from CNPq, Brazil F is a field of characteristic zero; F X = F x 1, x 2,... is the free associative
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 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 informationAverage Coset Weight Distributions of Gallager s LDPC Code Ensemble
1 Average Coset Weight Distributions of Gallager s LDPC Code Ensemble Tadashi Wadayama Abstract In this correspondence, the average coset eight distributions of Gallager s LDPC code ensemble are investigated.
More informationMöller s Algorithm. the algorithm developed in [14] was improved in [18] and applied in order to solve the FGLM-problem;
Möller s Algorithm Teo Mora (theomora@disi.unige.it) Duality was introduced in Commutative Algebra in 1982 by the seminal paper [14] but the relevance of this result became clear after the same duality
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 informationAlgebraic function fields
Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which
More informationPublished in: Proceedings of the 21st Symposium on Mathematical Theory of Networks and Systems
Aalborg Universitet Affine variety codes are better than their reputation Geil, Hans Olav; Martin, Stefano Published in: Proceedings of the 21st Symposium on Mathematical Theory of Networks and Systems
More informationComputational Formal Resolution of Surfaces in P 3 C
Computational Formal Resolution of Surfaces in P 3 C {Tobias.Beck Josef.Schicho}@oeaw.ac.at RICAM-Linz Austrian Academy of Sciences July 31 / Magma 2006 Berlin T. Beck, J. Schicho (RICAM-Linz) Computational
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationJanuary 2016 Qualifying Examination
January 2016 Qualifying Examination If you have any difficulty with the wording of the following problems please contact the supervisor immediately. All persons responsible for these problems, in principle,
More informationStandard Bases for Linear Codes over Prime Fields
Standard Bases for Linear Codes over Prime Fields arxiv:1708.05490v1 cs.it] 18 Aug 2017 Jean Jacques Ferdinand RANDRIAMIARAMPANAHY 1 e-mail : randriamiferdinand@gmail.com Harinaivo ANDRIATAHINY 2 e-mail
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals
Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals
More informationDeterminant Formulas for Inhomogeneous Linear Differential, Difference and q-difference Equations
MM Research Preprints, 112 119 No. 19, Dec. 2000. Beijing Determinant Formulas for Inhomogeneous Linear Differential, Difference and q-difference Equations Ziming Li MMRC, Academy of Mathematics and Systems
More informationIdempotent Generators of Generalized Residue Codes
1 Idempotent Generators of Generalized Residue Codes A.J. van Zanten A.J.vanZanten@uvt.nl Department of Communication and Informatics, University of Tilburg, The Netherlands A. Bojilov a.t.bozhilov@uvt.nl,bojilov@fmi.uni-sofia.bg
More informationan author's https://oatao.univ-toulouse.fr/18723 http://dx.doi.org/10.1109/isit.2017.8006599 Detchart, Jonathan and Lacan, Jérôme Polynomial Ring Transforms for Efficient XOR-based Erasure Coding. (2017)
More informationERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on February 14, 2018)
ERRATA Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on February 14, 2018) These are errata for the Third Edition of the book. Errata from previous editions have been
More informationGröbner bases for decoding
Gröbner bases for decoding Mario de Boer and Ruud Pellikaan Appeared in Some tapas of computer algebra (A.M. Cohen, H. Cuypers and H. Sterk eds.), Chap. 11, Gröbner bases for decoding, pp. 260-275, Springer,
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
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 informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
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 information8. Prime Factorization and Primary Decompositions
70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
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 informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationThe F 4 Algorithm. Dylan Peifer. 9 May Cornell University
The F 4 Algorithm Dylan Peifer Cornell University 9 May 2017 Gröbner Bases History Gröbner bases were introduced in 1965 in the PhD thesis of Bruno Buchberger under Wolfgang Gröbner. Buchberger s algorithm
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 informationGRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases
GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationSection 33 Finite fields
Section 33 Finite fields Instructor: Yifan Yang Spring 2007 Review Corollary (23.6) Let G be a finite subgroup of the multiplicative group of nonzero elements in a field F, then G is cyclic. Theorem (27.19)
More informationFiniteness Issues on Differential Standard Bases
Finiteness Issues on Differential Standard Bases Alexey Zobnin Joint research with M.V. Kondratieva and D. Trushin Department of Mechanics and Mathematics Moscow State University e-mail: al zobnin@shade.msu.ru
More informationSchool of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information
MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon
More informationVarious algorithms for the computation of Bernstein-Sato polynomial
Various algorithms for the computation of Bernstein-Sato polynomial Applications of Computer Algebra (ACA) 2008 Notations and Definitions Motivation Two Approaches Let K be a field and let D = K x, = K
More informationMath 418 Algebraic Geometry Notes
Math 418 Algebraic Geometry Notes 1 Affine Schemes Let R be a commutative ring with 1. Definition 1.1. The prime spectrum of R, denoted Spec(R), is the set of prime ideals of the ring R. Spec(R) = {P R
More informationLower bound of the covering radius of binary irreducible Goppa codes
Lower bound of the covering radius of binary irreducible Goppa codes Sergey Bezzateev, Natalia Shekhunova To cite this version: Sergey Bezzateev, Natalia Shekhunova. Lower bound of the covering radius
More informationFULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS. Jian-yi Shi
FULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS Jian-yi Shi Abstract. The main goal of the paper is to show that the fully commutative elements in the affine
More informationSkew cyclic codes: Hamming distance and decoding algorithms 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
More informationRational Univariate Representation
Rational Univariate Representation 1 Stickelberger s Theorem a rational univariate representation (RUR) 2 The Elbow Manipulator a spatial robot arm with three links 3 Application of the Newton Identities
More informationAnalysis of Some Quasigroup Transformations as Boolean Functions
M a t h e m a t i c a B a l k a n i c a New Series Vol. 26, 202, Fasc. 3 4 Analysis of Some Quasigroup Transformations as Boolean Functions Aleksandra Mileva Presented at MASSEE International Conference
More informationHILBERT FUNCTIONS. 1. Introduction
HILBERT FUCTIOS JORDA SCHETTLER 1. Introduction A Hilbert function (so far as we will discuss) is a map from the nonnegative integers to themselves which records the lengths of composition series of each
More informationJournal of Symbolic Computation. On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
Journal of Symbolic Computation 47 (2012) 480 491 Contents lists available at SciVerse ScienceDirect Journal of Symbolic Computation journal homepage: wwwelseviercom/locate/jsc On the Berlekamp/Massey
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationCANONICAL FORMS FOR LINEAR TRANSFORMATIONS AND MATRICES. D. Katz
CANONICAL FORMS FOR LINEAR TRANSFORMATIONS AND MATRICES D. Katz The purpose of this note is to present the rational canonical form and Jordan canonical form theorems for my M790 class. Throughout, we fix
More informationRank Analysis of Cubic Multivariate Cryptosystems
Rank Analysis of Cubic Multivariate Cryptosystems John Baena 1 Daniel Cabarcas 1 Daniel Escudero 2 Karan Khathuria 3 Javier Verbel 1 April 10, 2018 1 Universidad Nacional de Colombia, Colombia 2 Aarhus
More informationGeneralized hyper-bent functions over GF(p)
Discrete Applied Mathematics 55 2007) 066 070 Note Generalized hyper-bent functions over GFp) A.M. Youssef Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G
More informationPolynomial interpolation over finite fields and applications to list decoding of Reed-Solomon codes
Polynomial interpolation over finite fields and applications to list decoding of Reed-Solomon codes Roberta Barbi December 17, 2015 Roberta Barbi List decoding December 17, 2015 1 / 13 Codes Let F q be
More informationITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N ( ) 451
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 39 2018 451 464 451 ON THE k-normal ELEMENTS AND POLYNOMIALS OVER FINITE FIELDS Mahmood Alizadeh Department of Mathematics Ahvaz Branch Islamic Azad University
More informationGALOIS THEORY. Contents
GALOIS THEORY MARIUS VAN DER PUT & JAAP TOP Contents 1. Basic definitions 1 1.1. Exercises 2 2. Solving polynomial equations 2 2.1. Exercises 4 3. Galois extensions and examples 4 3.1. Exercises. 6 4.
More informationDecoding linear codes via systems solving: complexity issues and generalized Newton identities
Decoding linear codes via systems solving: complexity issues and generalized Newton identities Stanislav Bulygin (joint work with Ruud Pellikaan) University of Valladolid Valladolid, Spain March 14, 2008
More informationJORDAN NORMAL FORM. Contents Introduction 1 Jordan Normal Form 1 Conclusion 5 References 5
JORDAN NORMAL FORM KATAYUN KAMDIN Abstract. This paper outlines a proof of the Jordan Normal Form Theorem. First we show that a complex, finite dimensional vector space can be decomposed into a direct
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 27 January. Gröbner bases
Gröbner bases In this lecture we introduce Buchberger s algorithm to compute a Gröbner basis for an ideal, following [2]. We sketch an application in filter design. Showing the termination of Buchberger
More informationError-correcting Pairs for a Public-key Cryptosystem
Error-correcting Pairs for a Public-key Cryptosystem Ruud Pellikaan g.r.pellikaan@tue.nl joint work with Irene Márquez-Corbella Code-based Cryptography Workshop 2012 Lyngby, 9 May 2012 Introduction and
More informationProjective space. There are some situations when this approach seems to break down; for example with an equation like f(x; y) =y 2 (x 3 5x +3) the lin
Math 445 Handy facts since the second exam Don't forget the handy facts from the first two exams! Rational points on curves For more general curves, defined by polynomials f(x; y) = 0 of higher degree,
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 information