On the complete decoding of constrained codes

DOI10.1109/18.179363MaRDI QIDQ4034457zbMATH OpenOpenAlexFDO

Authors Albertus S. J. Helberg, Hendrik C. Ferreira

Publication date 16 May 1993

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

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

zbMATH Keywords

maximum likelihood algorithmbalanced codesline codesrecording codes\((d,k)\) constraintserror multiplication probabilities

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• On the complete decoding of binary linear codes (Corresp.)
• scientific article; zbMATH DE number 4092795
• On a complete decoding scheme for binary radical codes
• Constrained coding and soft iterative decoding
• On completion of codes with finite deciphering delay
• A semigroup approach to complete decoding
• On decoding concatenated codes
• On the reconstruction of perfect codes
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• scientific article; zbMATH DE number 4104870

Cited in

(8)

• Constrained Codes as Networks of Relations
• Heegard–Berger and Cascade Source Coding Problems With Common Reconstruction Constraints
• Tradeoff functions for constrained systems with unconstrained positions
• Presentations of Constrained Systems With Unconstrained Positions
• Consolidation for compact constraints and Kendall tau LP decodable permutation codes
• scientific article; zbMATH DE number 6665189 (Why is no real title available?)
• Constrained systems with unconstrained positions
• On the problem of finding zero-concurring codewords

This page was built for publication: On the complete decoding of constrained codes

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