Multialphabet coding with separate alphabet description
(1997) Proceedings of the 1997 International Conference on Compression and Complexity of Sequences p.56-65- Abstract
For lossless universal source coding of memoryless sequences with an a priori unknown alphabet size (multialphabet coding), the alphabet of the sequence must be described as well as the sequence itself. Usually an efficient description of the alphabet can be made only by taking into account some additional information. We show that these descriptions can be separated in such a way that the encoding of the actual sequence can be performed independently of the alphabet description, and present sequential coding methods for such sequences. Such methods have applications in coding methods where the alphabet description is made available sequentially, such as PPM.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/816f20e1-39e5-4c8e-898f-d7a86fb8267a
- author
- Aberg, Jan LU ; Shtarkov, Yu M. and Smeets, B. J.M. LU
- organization
- publishing date
- 1997
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Proceedings. Compression and Complexity of SEQUENCES 1997
- pages
- 10 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- Proceedings of the 1997 International Conference on Compression and Complexity of Sequences
- conference location
- Positano, Italy
- conference dates
- 1997-06-11 - 1997-06-13
- external identifiers
-
- scopus:0031346493
- ISBN
- 0-8186-8132-2
- DOI
- 10.1109/SEQUEN.1997.666903
- language
- English
- LU publication?
- yes
- id
- 816f20e1-39e5-4c8e-898f-d7a86fb8267a
- date added to LUP
- 2021-11-05 02:37:57
- date last changed
- 2022-02-02 01:16:12
@inproceedings{816f20e1-39e5-4c8e-898f-d7a86fb8267a, abstract = {{<p>For lossless universal source coding of memoryless sequences with an a priori unknown alphabet size (multialphabet coding), the alphabet of the sequence must be described as well as the sequence itself. Usually an efficient description of the alphabet can be made only by taking into account some additional information. We show that these descriptions can be separated in such a way that the encoding of the actual sequence can be performed independently of the alphabet description, and present sequential coding methods for such sequences. Such methods have applications in coding methods where the alphabet description is made available sequentially, such as PPM.</p>}}, author = {{Aberg, Jan and Shtarkov, Yu M. and Smeets, B. J.M.}}, booktitle = {{Proceedings. Compression and Complexity of SEQUENCES 1997}}, isbn = {{0-8186-8132-2}}, language = {{eng}}, pages = {{56--65}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Multialphabet coding with separate alphabet description}}, url = {{http://dx.doi.org/10.1109/SEQUEN.1997.666903}}, doi = {{10.1109/SEQUEN.1997.666903}}, year = {{1997}}, }