Journal of Symbolic Computation
Cryptographic properties of some binary generalized cyclotomic sequences with the length p2
Information Sciences: an International Journal
A tamper-proof and lightweight authentication scheme
Pervasive and Mobile Computing
Studies on the distribution of the shortest linear recurring sequences
Information Sciences: an International Journal
A Lookup Table Decoding of systematic (47,24,11) quadratic residue code
Information Sciences: an International Journal
Bounded distance decoding of linear error-correcting codes with Gröbner bases
Journal of Symbolic Computation
High speed true random number generator based on open loop structures in FPGAs
Microelectronics Journal
IBM Systems Journal
Encryption System with Variable Number of Registers
Computers and Electrical Engineering
On the joint linear complexity profile of explicit inversive multisequences
Journal of Complexity
A distortion-minimizing rate controller for wireless multimedia sensor networks
Computer Communications
A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
Information Processing Letters
Analysis of the generalized self-shrinking generator
Computers & Mathematics with Applications
On Dillon's class H of bent functions, Niho bent functions and o-polynomials
Journal of Combinatorial Theory Series A
On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
Journal of Symbolic Computation
On identity testing of tensors, low-rank recovery and compressed sensing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Paper: A study of MBH-type realization algorithms
Automatica (Journal of IFAC)
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
Information Processing Letters
On minimal polynomials over Fqm and over Fq of a finite-length sequence over F qm
Finite Fields and Their Applications
Multi-continued fraction algorithm and generalized B--M algorithm over Fq
Finite Fields and Their Applications
Counting functions and expected values for the lattice profile at n
Finite Fields and Their Applications
New Techniques for the Computation of Linear Recurrence Coefficients
Finite Fields and Their Applications
Finite Fields and Their Applications
On the Structure of Order Domains
Finite Fields and Their Applications
Counting Functions and Expected Values for the k-Error Linear Complexity
Finite Fields and Their Applications
New classes of quaternary cyclotomic sequence of length 2pm with high linear complexity
Information Processing Letters
Representation of sparse Legendre expansions
Journal of Symbolic Computation
PUFKY: a fully functional PUF-based cryptographic key generator
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Quadratic functions with prescribed spectra
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Designs, Codes and Cryptography
On the matrix berlekamp-massey algorithm
ACM Transactions on Algorithms (TALG)
Algebraic attacks on a class of stream ciphers with unknown output function
Designs, Codes and Cryptography
A family of new complex number chaotic maps based image encryption algorithm
Image Communication
Digital logic with molecular reactions
Proceedings of the International Conference on Computer-Aided Design
Fast skew-feedback shift-register synthesis
Designs, Codes and Cryptography
Evaluation codes defined by finite families of plane valuations at infinity
Designs, Codes and Cryptography
Decoding interleaved Reed---Solomon codes beyond their joint error-correcting capability
Designs, Codes and Cryptography
Optimal parameters for the WG stream cipher family
Cryptography and Communications
| Hi-index | 754.84 |
It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits. The shift-register approach leads to a simple proof of the validity of the algorithm as well as providing additional insight into its properties. The equivalence of the decoding problem for BCH codes to a shift-register synthesis problem is demonstrated, and other applications for the algorithm are suggested.