On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes

DOI10.1006/ffta.1995.1035zbMath0835.94022OpenAlexW1995802958MaRDI QIDQ1904531

Norifumi Kamiya

Publication date: 1 February 1996

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1995.1035

zbMATH Keywords

Reed-Solomon codesWelch-Berlekamp algorithmBerlekamp-Massey algorithmfeedback shift registergeneralized-minimum-distance decodingmultisequence shift register synthesis

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Parallel algorithms in computer science (68W10) Cyclic codes (94B15) Decoding (94B35)

Related Items (3)

Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences ⋮ Efficient linear feedback shift registers with maximal period

This page was built for publication: On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes