A fast algorithm for the unique decipherability of multivalued encodings

DOI10.1016/0304-3975(94)90278-XzbMath0817.94004OpenAlexW1963979371MaRDI QIDQ1341741

Luisa Gargano, Ugo Vaccaro, Renato M. Capocelli

Publication date: 9 January 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90278-x

zbMATH Keywords

algorithmtime complexityencodingsdecipherabilitymultivalued encodings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10) Decoding (94B35) Source coding (94A29)

Related Items (2)

On numerically decipherable codes and their homophonic partitions ⋮ The finest homophonic partition and related code concepts

Cites Work

• Decoders with initial state invariance for multivalued encodings
• Structure of decoders for multivalued encodings
• On multiset decipherable codes (Corresp.)
• Tests for unique decipherability
• A decision procedure for finite decipherability and synchronizability of multivalued encodings
• Efficient string matching
• A note on uniquely decipherable codes (Corresp.)
• A decision procedure for the unique decipherability of multivalued encodings (Corresp.)
• Two inequalities implied by unique decipherability
• Generalization of tests for certain properties of variable-length codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast algorithm for the unique decipherability of multivalued encodings