On the size of transducers for bidirectional decoding of prefix codes
From MaRDI portal
Publication:2889182
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
Cites work
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 5170141 (Why is no real title available?)
- Bidirectional Huffman coding
- Codes and automata.
- Transducers for the bidirectional decoding of prefix codes
- Variable length codes and finite automata
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)