X - International Journal of Information Science and Computer Mathematics (Closed Ed TRF)
Volume 2, Issue 1, Pages 75 - 86
(August 2010)
|
|
CONSTRUCTION OF SYMMETRICAL REVERSIBLE VARIABLE LENGTH CODES FOR A MARKOVIAN SOURCE
Richa Gupta and Bhudev Sharma
|
Abstract:
Reversible variable length codes have gained a lot of attention with the development of the upcoming video coding standards like H.263+ and MPEG-4. Due to their excellent error resilient properties, they have found a large application in the data recovery in the fields of video and image processing. The algorithm for the construction of reversible variable length codes proposed by Yan and Lin makes use of a data structure called queue, and the algorithm is independent of Huffman Code. Using this algorithm the average codeword length is determined. This paper uses Yan’s algorithm over the English alphabets under Markovian Model and compares it with Takishima algorithm, Modified Takishima algorithm, Tsai algorithm, and Jeong and Ho algorithm. We demonstrate that the optimised average codeword length can be obtained if we use Yan’s algorithm over the English alphabet’s distribution under Markovian Model. |
| Keywords and phrases: reversible variable length code, Huffman codes, Markov model, average codeword length. |
| Communicated by Kewen Zhao |
| Number of Downloads: 65 | Number of Views: 235 |
|
