A generalized Euclidean algorithm for multisequence shift-register synthesis
From MaRDI portal
Publication:3832461
DOI10.1109/18.30981zbMath0676.94011OpenAlexW2071184318MaRDI QIDQ3832461
No author found.
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.30981
BCH codesdecodingcyclic codesmultiple sequenceslinear feedback shift-registermultiple syndrome sequences
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclic codes (94B15) Decoding (94B35)
Related Items
Studies on the distribution of the shortest linear recurring sequences ⋮ On lattice-based algebraic feedback shift registers synthesis for multisequences ⋮ 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 ⋮ Improved power decoding of interleaved one-point Hermitian codes ⋮ Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction ⋮ 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
This page was built for publication: A generalized Euclidean algorithm for multisequence shift-register synthesis
