Bounded distance decoding of unit memory codes

DOI10.1109/18.259645MaRDI QIDQ4307374zbMATH OpenOpenAlexFDO

Authors Jørn Justesen

Publication date 3 October 1994

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

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

zbMATH Keywords

convolutional codesminimum distance decoding

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• New upper bounds for decoding error probability for convolutional codes
• Distance approach to window decoding
• Minimum distance estimates of the performance of sequential decoders
• scientific article; zbMATH DE number 3272068

Cited in

(13)

• Coding theory: the unit-derived methodology
• Table based decoding of rate one-half convolutional codes
• Error probabilities for bounded distance decoding
• Some constructions of generalised concatenated codes based on unit memory codes
• On periodic (partial) unit memory codes with maximum free distance
• scientific article; zbMATH DE number 3793938 (Why is no real title available?)
• A unified method to construct neural network decoders for arbitrary codes and decoding rules
• On the complexity of bounded distance decoding for the AWGN channel
• On (partial) unit memory codes based on Gabidulin codes
• A repeat request strategy based on sliding window decoding of unit-memory convolutional codes
• Distance approach to window decoding
• Minimum distance estimates of the performance of sequential decoders
• Concatenated codes with convolutional inner and outer codes

This page was built for publication: Bounded distance decoding of unit memory codes

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