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

DOI10.1142/S0129054115500410zbMath1372.94402OpenAlexW2160600271MaRDI 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)

Full work available at URL: https://doi.org/10.1142/s0129054115500410

zbMATH Keywords

codedeciphering delaystrongly connected componenttransducerunlabeled graphprefix (free) code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35) Prefix, length-variable, comma-free codes (94A45)

Cites Work

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

This page was built for publication: A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay