Universal variable-to-fixed length source codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5941301
- Variable to fixed-length codes for Markov sources
- Optimal universal coding with respect to the maximal individual relative redundancy criterion
- Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
- Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes
Cited in
(15)- Optimal universal coding with respect to the maximal individual relative redundancy criterion
- Universal coding with minimum probability of codeword length overflow
- Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
- Asymptotic Properties on Codeword Lengths of an Optimal FV Code for General Sources
- On overflow and underflow problems in buffer-instrumented variable-length coding of fixed- rate memoryless sources (Corresp.)
- Variable to fixed-length codes for Markov sources
- Efficient universal noiseless source codes
- Minimax noiseless universal coding for Markov sources
- A universal variable-to-fixed length source code based on Lawrence's algorithm
- Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes
- Some basic properties of fix-free codes
- Universal multiresolution source codes
- Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources
- Variable-to-fixed length codes and the conservation of entropy
- Buffer overflow in variable length coding of fixed rate sources
This page was built for publication: Universal variable-to-fixed length source codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544579)