On the size of transducers for bidirectional decoding of prefix codes
DOI10.1051/ITA/2012006zbMATH Open1278.94038OpenAlexW2106651384MaRDI QIDQ2889182FDOQ2889182
Authors: Laura Giambruno, Sabrina Mantaci 
Publication date: 4 June 2012
Published in: RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/221991
Recommendations
- Transducers for the bidirectional decoding of prefix codes
- Bounding the inefficiency of length-restricted prefix codes
- On the decomposition of prefix codes
- On the ratio of prefix codes to all uniquely decodable codes with a given length distribution
- scientific article; zbMATH DE number 3910298
- On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
- scientific article; zbMATH DE number 1286207
- On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources
- Efficient and Compact Representations of Prefix Codes
- A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35)
Cites Work
Cited In (5)
- Transducers for the bidirectional decoding of prefix codes
- Applications of transducers in independent languages, word distances, codes
- Estimating the minimal number of states of a subsequential decoder
- A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
- A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
This page was built for publication: On the size of transducers for bidirectional decoding of prefix codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889182)
