Complexity and sliding-block decodability

DOI10.1109/18.556685zbMath0877.94019OpenAlexW2158485608MaRDI QIDQ3129478

Razmik Karabed, Jonathan Ashley, Paul H. Siegel

Publication date: 15 December 1997

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

Full work available at URL: https://semanticscholar.org/paper/4ee19452c0b234e0ce1a0c7081e0cd4fea621ed2

zbMATH Keywords

graph coloringNP-completenessconstrained systemssliding-block decoder

Mathematics Subject Classification ID

Other types of codes (94B60) Coloring of graphs and hypergraphs (05C15) Source coding (94A29)

This page was built for publication: Complexity and sliding-block decodability