Complexity and sliding-block decodability

DOI10.1109/18.556685MaRDI QIDQ3129478zbMATH OpenOpenAlexFDO

Authors Jonathan J. Ashley, Razmik Karabed, Paul 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

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

Recommendations

• Decoding complexity of linear block codes
• Decoding complexity bound for linear block codes
• scientific article; zbMATH DE number 4123671
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• Trellis decoding complexity of linear block codes
• Bounds on complexity of trellis decoding of linear block codes
• Sliding-block source coding
• Algorithms for sliding block codes - An application of symbolic dynamics to information theory
• Complexity of Decoding Positive-Rate Reed-Solomon Codes
• On the trellis complexity of block and convolutional codes

Cited in

(9)

• Stabilization of Block-Type-Decodability Properties for Constrained Systems
• A linear bound for sliding-block decoder window size
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• Construction of encoders with small decoding look-ahead for input-constrained channels
• Links between complexity theory and constrained block coding
• Optimal block-type-decodable encoders for constrained systems
• Canonical Encoders for Sliding Block Decoders
• Sliding block codes between shift spaces over infinite alphabets
• Minimum scope for sliding block decoder mappings

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

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