Shift-register synthesis and BCH decoding
Explore this paper's citation graph
Summary
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.
- Type
- article
- Published
- 1969-01-01
- Cited by
- 2,370
- References
- 7
- OpenAlex
- https://openalex.org/W2162442687
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:9003708
Keywords
BCH code, Shift register, Berlekamp–Welch algorithm, Decoding methods, Computer science
References
Cited by
- Algebraic list-decoding of error-correcting codes
- New Decoding Methods for LDPC Codes on Error and Error-Erasure Channels
- Polynomial Systems Solving by Fast Linear Algebra
- Optimisation heuristics for cryptology
- On tridiagonal binary matrices and LFSRs. A survey
- ALGEBRAIC ATTACKS ON STREAM CIPHERS
- Anpassungsfähige Datenkompression und Dekompression / A self-adaptive method of data compression and expansion
- Avances en el estudio de la complejidad lineal del filtrado no lineal
- Automated statistical methods for measuring the strength of block ciphers
- Approximation Algorithms and New Models for Clustering and Learning
- Effective computation of cryptanalytic measures for stream cipher data by the Rissanen algorithmus
- Codes and decoding on graphs
- Study on stream ciphers using generating functions
- Forme d'onde multiporteuse pour de la diffusion par satellite haute capacité. (Multicarrier waveform for high capacity satellite broadcasting)
- Mathematical Systems Theory: Conceptual Framework and Application Examples
- Analysis of nonlinear sequences and streamciphers
- Codes AL-FEC hautes performances pour les canaux à effacements : variations autour des codes LDPC. (High performances AL-FEC codes for the erasure channel : variation around LDPC codes)
- Displacement structure for Hankel- and Vandermode-like matrices
- Distributed Control and Computing: Optimal Estimation, Error-Correcting Codes, and Interactive Protocols
- Advanced OFDM systems for terrestrial multimedia links
Related papers
- High-speed decoding of BCH codes
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Decoding beyond the BCH bound (Corresp.)
- Extension of Welch-Berlekamp theorem and universal strategy of decoding algorithm beyond BCH bound
- Berlekamp-Massey Algorithm: Euclid in Disguise
- New time domain errors and erasures decoding algorithm for BCH codes
- Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)