Links between complexity theory and constrained block coding

DOI10.1109/18.971739zbMATH1059.94045OpenAlexW2165777477MaRDI QIDQ4544764FDOQ4544764

Authors Dharmendra S. Modha, Larry J. Stockmeyer

Publication date 4 August 2002

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

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Some Applications of Coding Theory in Computational Complexity
• scientific article; zbMATH DE number 4123671
• On the trellis complexity of block and convolutional codes
• Decoding complexity bound for linear block codes
• scientific article; zbMATH DE number 606784
• Convolutional codes and complexity
• Decoding complexity of linear block codes
• Complexity and sliding-block decodability
• Block codes for a class of constrained noiseless channels
• scientific article; zbMATH DE number 1284420

Cited in

(8)

• On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
• Sur la complexité d'un problème de codage
• Endcoding Complexity Versus Minimum Distance
• scientific article; zbMATH DE number 1418320 (Why is no real title available?)
• Constrained Codes as Networks of Relations
• The Complexity of Horizontal Word Encoding in Microprogrammed Machines
• scientific article; zbMATH DE number 2063192 (Why is no real title available?)
• Zero-error instantaneous coding of correlated sources with length constraints is NP-complete

This page was built for publication: Links between complexity theory and constrained block coding

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