Multialphabet coding with separate alphabet description

Jan Aberg; Yu M. Shtarkov; B. J.M. Smeets

doi:10.1109/SEQUEN.1997.666903

Multialphabet coding with separate alphabet description

Jan Aberg, Yu M. Shtarkov, B. J.M. Smeets

Department of Electrical and Information Technology

Institute for Information Transmission Problems Russian Academy of Sciences

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

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.

Original language	English
Title of host publication	Proceedings. Compression and Complexity of SEQUENCES 1997
Publisher	IEEE - Institute of Electrical and Electronics Engineers Inc.
Pages	56-65
Number of pages	10
ISBN (Print)	0-8186-8132-2
DOIs	https://doi.org/10.1109/SEQUEN.1997.666903
Publication status	Published - 1997
Event	Proceedings of the 1997 International Conference on Compression and Complexity of Sequences - Positano, Italy Duration: 1997 Jun 11 → 1997 Jun 13

Conference

Conference	Proceedings of the 1997 International Conference on Compression and Complexity of Sequences
City	Positano, Italy
Period	1997/06/11 → 1997/06/13

Subject classification (UKÄ)

Telecommunications

Access to Document

10.1109/SEQUEN.1997.666903

Cite this

@inproceedings{816f20e139e54c8e898fd7a86fb8267a,

title = "Multialphabet coding with separate alphabet description",

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.",

author = "Jan Aberg and Shtarkov, {Yu M.} and Smeets, {B. J.M.}",

year = "1997",

doi = "10.1109/SEQUEN.1997.666903",

language = "English",

isbn = "0-8186-8132-2",

pages = "56--65",

booktitle = "Proceedings. Compression and Complexity of SEQUENCES 1997",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "Proceedings of the 1997 International Conference on Compression and Complexity of Sequences ; Conference date: 11-06-1997 Through 13-06-1997",

}

Aberg, J, Shtarkov, YM & Smeets, BJM 1997, Multialphabet coding with separate alphabet description. in Proceedings. Compression and Complexity of SEQUENCES 1997. IEEE - Institute of Electrical and Electronics Engineers Inc., pp. 56-65, Proceedings of the 1997 International Conference on Compression and Complexity of Sequences, Positano, Italy, 1997/06/11. https://doi.org/10.1109/SEQUEN.1997.666903

TY - GEN

T1 - Multialphabet coding with separate alphabet description

AU - Aberg, Jan

AU - Shtarkov, Yu M.

AU - Smeets, B. J.M.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

U2 - 10.1109/SEQUEN.1997.666903

DO - 10.1109/SEQUEN.1997.666903

M3 - Paper in conference proceeding

AN - SCOPUS:0031346493

SN - 0-8186-8132-2

SP - 56

EP - 65

BT - Proceedings. Compression and Complexity of SEQUENCES 1997

PB - IEEE - Institute of Electrical and Electronics Engineers Inc.

T2 - Proceedings of the 1997 International Conference on Compression and Complexity of Sequences

Y2 - 11 June 1997 through 13 June 1997

ER -