A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay

DOI10.1142/S0129054115500410zbMath1372.94402MaRDI QIDQ5899549

Carla Selmi, Jean Néraud, Sabrina Mantaci, Laura Giambruno

Publication date: 11 December 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

code; deciphering delay; strongly connected component; transducer; unlabeled graph; prefix (free) code

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

94B35: Decoding

94A45: Prefix, length-variable, comma-free codes

Cites Work

• Transducers for the bidirectional decoding of prefix codes
• On the size of transducers for bidirectional decoding of prefix codes
• Bidirectional Huffman Coding