A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes

DOI10.1109/18.133246zbMath0734.94008OpenAlexW2158558186MaRDI QIDQ3363228

No author found.

Publication date: 1991

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.133246

zbMATH Keywords

iterative algorithmBerlekamp-Massey algorithmerror-locator polynomialRoos boundBCH codingdecoding cyclic codesminimum length linear feedback shift registersmultiple syndrome sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclic codes (94B15) Decoding (94B35)

Related Items (27)

Matrix-product structure of repeated-root cyclic codes over finite fields ⋮ More on solving systems of power equations ⋮ A symmetric Roos bound for linear codes ⋮ Studies on the distribution of the shortest linear recurring sequences ⋮ Linear recurring sequences over rings and modules ⋮ On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding ⋮ An algorithm for constructing a minimal partial realization in the multivariable case ⋮ On lattice-based algebraic feedback shift registers synthesis for multisequences ⋮ Some decoding applications of minimal realization ⋮ Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension ⋮ Fast skew-feedback shift-register synthesis ⋮ Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability ⋮ A lattice-based minimal partial realization algorithm for matrix sequences of varying length ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ On decoding by error location and dependent sets of error positions ⋮ Lattice basis reduction algorithms and multi-dimensional continued fractions ⋮ Linear feedback shift registers and the minimal realization problem ⋮ On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\) ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\) ⋮ A Lattice-Based Minimal Partial Realization Algorithm ⋮ Parallel Generation of ℓ-Sequences ⋮ A linear algebraic approach to multisequence shift-register synthesis ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences ⋮ Decoding of repeated-root cyclic codes up to new bounds on their minimum distance ⋮ Gröbner basis solutions of constrained interpolation problems

This page was built for publication: A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes