Bounded minimal distance decoding of (P)UM codes based on RS codes

zbMATH Open0901.94033MaRDI QIDQ1925353FDOQ1925353

Authors: U. Dettmar, Ulrich Sorger 

Publication date: 15 December 1996

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• A new construction of partial unit memory codes based on Reed-Solomon codes
• On periodic (partial) unit memory codes with maximum free distance
• On (partial) unit memory codes based on Gabidulin codes
• Bounded distance decoding of unit memory codes

zbMATH Keywords

algorithmcomplexityReed-Solomon codespartial unit memory codesBMD decoding algorithmbounded minimum distance decoding

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Decoding (94B35)

This page was built for publication: Bounded minimal distance decoding of (P)UM codes based on RS codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925353)