On numerically decipherable codes and their homophonic partitions
From MaRDI portal
Publication:2390234
DOI10.1016/j.ipl.2004.02.010zbMath1177.68089MaRDI QIDQ2390234
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.02.010
combinatorial problems; homophonic partition; homophonically decipherable code; multivalued encoding; numerically decipherable code
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A29: Source coding
Cites Work
- Unnamed Item
- Decipherability of codes
- A fast algorithm for the unique decipherability of multivalued encodings
- Note on decipherability of three-word codes
- On multiset decipherable codes (Corresp.)
- A note on multiset decipherable codes
- A decision procedure for the unique decipherability of multivalued encodings (Corresp.)
- On unique, multiset, and set decipherability of three-word codes
- Deciding multiset decipherability
- The finest homophonic partition and related code concepts
- STACS 2005