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

MaRDI QIDQ1925353zbMATH OpenFDO

Authors U. Dettmar, Ulrich Sorger

Publication date 15 December 1996

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

zbMATH Keywords

algorithmBMD decoding algorithmbounded minimum distance decodingcomplexitypartial unit memory codesReed-Solomon codes

Mathematics Subject Classification ID

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

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

Cited in

(1)

• On the construction of trellis codes based on (P)UM codes over Z₄

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)