Book Series: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 15th International Symposium, AAECC-15, Toulouse, France, May 12-16, 2003, Proceedings

By Alain Poli, Marc Fossorier, Tom Hoeholdt

G. Everest and T. Ward, Heights of Polynomials and Entropy in Algebraic Dynamics, Springer-Verlag, London, 1999. M. Flahive and H. Niederreiter, On inversive congruential generators for pseudorandom numbers, Finite Fields, Coding Theory ...

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings

By Alain Poli, Shu Lin, Marc Fossorier

This book constitutes the refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16, held in Las Vegas, NV, USA in February 2006.

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 12th International Symposium, AAECC-12, Toulouse, France, June, 23-27, 1997, Proceedings

By Teo Mora

More precisely , let y ( 2 ) , ( z ) E F , [ z ] . The polynomials ( z ) and 4 ( z ) define a ring - homomorphism from Fq [ , y ) / ( f ( x ) , y ^ – a ( z ) ) to F9 [ z ] / f ( $ ( z ) ) in the following way c ( x , y ) mod ( f ( x ) ...

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings

By Serdar Boztas, Hsiao-feng Lu

We have used the Hamming weight to ensure Q(Z)=0intheabove argument. The conventional method [10,9] used the degree of a polynomial and the pole order of an algebraic function to ensure Q(Z) = 0. The use of Hamming weight allows us to ...

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 13th International Symposium, AAECC-13 Honolulu, Hawaii, USA, November 15-19, 1999 Proceedings

By Alain Poli, Shu Lin, Marc Fossorier

Let (J.C.)o k(x)|Z|0 kB&, Z])|X=x be the ideal of all polynomials from Ji (x)& k(x)|Z with the algebraically independent parameters a 1, ..., an replaced by the variables X1, ..., Xn. Furthermore let HG 3 k[X, Z be as above.

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings

By Gérard Cohen, Teo Mora, Marc Giusti

Now , let V and Z be two manifolds of class Co . We consider , with the same methods , two points I e V , u E Z and the germs of functions f verifying f ( x ) = u ( resp . g ( x ) = u ) ; f is called equivalent to g , if and only if for ...

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 5th International Conference, AAECC-5, Menorca, Spain, June 15-19, 1987. Proceedings

By Llorenc Huguet

E G1 d ( z , x - 1 , Z x - 1 EL . If CL is one of these cliques , let L be the set CL n { a } . Each set L as above is a subgroup of Zy ( or of х if we consider the isomorphism Ø defined in theorem 1 ) , and #L = 9 .

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 15th International Symposium, AAECC-15, Toulouse, France, May 12-16, 2003, Proceedings

By Tom Hoeholdt

Let z = (z∞,z0,z1 ,··· ,zps−2) be a ps-tuple over GF(2) whose components correspond to the ps elements of GF(ps), i.e, zi corresponds to the field element αi. We call αi the location number of zi. For i = ∞,0,1,··· ,ps −2, ...

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 18th International Symposium, AAECC-18, Tarragona, Sapin, June 8-12, 2009, Proceedings

By Maria Bras-Amorós, Tom Høholdt

A rate k/n convolutional code C is a submodule of Fn[z] that can be described (see [21, 25]) as C = { v(z) ∈ Fn[z]| v(z) = G(z)u(z) with u(z) ∈ Fk[z] } where u(z) is the information vector or information word, v(z) is the code vector ...

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings

By Serdar Boztas, Igor E. Shparlinski

We show how different classes of existing algorithms (e.g., syndrome based or interpolation based, non-iterative, erasure adding or erasure deleting) fit into this framework. In doing this, we introduce a slightly more general WB key ...

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

By Sakata

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Applied Algebra, Algebraic Algorithms And Error-correcting Codes: 11th International Symposium

By G. Cohen

Applied Algebra, Algebraic Algorithms And Error-correcting Codes: 11th International Symposium

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

By Alain Poli, Marc Fossorier, Tom Hoeholdt

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

By Alain Poli, Llorenc Huguet

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

By Gérard Cohen, Teo Mora, Marc Giusti

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings

By Alain Poli, Shu Lin, Marc Fossorier

... Algebraic geometry codes, in the Handbook of coding theory, vol 1, pp. 871-961, Elsevier, Amsterdam, 1998. 9. Justesen, J., Høholdt, T.: A course in error-correcting codes. European Mathematical Society, Textbooks in Mathematics, 2004 ...

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 8th International Conference, AAECC-8, Tokyo, Japan, August 20-24, 1990. Proceedings

By Shojiro Sakata

Algebraic algorithms are not only interesting theoretically but also important in computer and communication engineering and many other fields. This volume contains the proceedings of the 8th AAECC conference, held in Tokyo in August 1990.

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14,...

By Gérard Cohen, Teo Mora

... Algorithms , and Error - correcting Codes : Proceedings of AAECC - 8 , Tokyo , 1990 ( S. Sakata , ed . ) . Berlin : Springer - Verlag , 1991 . [ 4 ] B. Buchberger , " Gröbner bases : An algorithmic method in polynomial ideal theory ...