A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay

DOI10.1142/S0129054115500410MaRDI QIDQ5899549zbMATH OpenOpenAlexFDO

Authors Laura Giambruno, Sabrina Mantaci, J. Néraud, C. Selmi

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 delayprefix (free) codestrongly connected componenttransducerunlabeled graph

Mathematics Subject Classification ID

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

Recommendations

• A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
• Transducers for the bidirectional decoding of prefix codes
• On the size of transducers for bidirectional decoding of prefix codes
• scientific article; zbMATH DE number 3974896
• Maximal codes with bounded deciphering delay

Cites work

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

Cited in

(4)

• On the size of transducers for bidirectional decoding of prefix codes
• scientific article; zbMATH DE number 1286207 (Why is no real title available?)
• A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
• Transducers for the bidirectional decoding of prefix codes

This page was built for publication: A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay

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