Sciweavers

AAECC
2002
Springer
113views Algorithms» more  AAECC 2002»
13 years 10 months ago
Groebner Bases and Distance of Cyclic Codes
Recently some methods have been proposed to find the distance of cyclic codes using Gr
Massimiliano Sala
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 10 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
AAECC
2002
Springer
98views Algorithms» more  AAECC 2002»
13 years 10 months ago
A Polynomial Representation of the Diffie-Hellman Mapping
Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for ...
Wilfried Meidl, Arne Winterhof
AAECC
2002
Springer
116views Algorithms» more  AAECC 2002»
13 years 10 months ago
A Computer Proof of a Series Evaluation in Terms of Harmonic Numbers
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...
Russell Lyons, Peter Paule, Axel Riese
AAECC
2002
Springer
126views Algorithms» more  AAECC 2002»
13 years 10 months ago
Toric Varieties Hirzebruch Surfaces and Error-Correcting Codes
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
Johan P. Hansen