Sciweavers

347 search results - page 1 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 11 months ago
The Berlekamp-Massey Algorithm revisited
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...
Nadia Ben Atti, Gema M. Diaz-Toca, Henri Lombardi
JISE
2007
83views more  JISE 2007»
13 years 10 months ago
Algebraic Decoding of Quadratic Residue Codes Using Berlekamp-Massey Algorithm
Y. H. Chen, T. K. Truong, Y. Chang, C. D. Lee, S. ...
DCC
2006
IEEE
14 years 10 months ago
Evaluation codes and plane valuations
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
C. Galindo, M. Sanchis
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
14 years 4 months ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 10 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...