Sliding block codes between constrained systems

DOI10.1109/18.243447MaRDI QIDQ4307333zbMATH OpenOpenAlexFDO

Authors Jonathan J. Ashley

Publication date 4 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.243447

zbMATH Keywords

650noncatastrophic codesliding block codesofic systems

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Complexity and sliding-block decodability
• A linear bound for sliding-block decoder window size. II
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity

Cited in

(7)

• Reducibility of covers of AFT shifts
• Sliding block codes between shift spaces over infinite alphabets
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• Sofic systems and encoding data
• Chains, entropy, coding
• A linear bound for sliding-block decoder window size
• A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon theorem

This page was built for publication: Sliding block codes between constrained systems

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