Variable-length code based on an order complexity

Soongi Hong, Minyoung Eom, Yoonsik Choe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we introduce new codeword sets based on order complexity (OC) which measures uncertainty of the order having each permutation string. The proposed codeword sets are generated by two procedures: Indexing and B-transform. Indexing is that a smaller positive integer is mapped to a permutation string whose OC is lower. B-transform plays role of generating a binary string from the permutation string on reflecting the OC, that is, low OC is represented by short binary strings and high OC is represented by long binary strings. The sets of these binary strings are our proposed codeword sets (B-codes). The B-codes are the uniquely decipherable complete variable length codeword sets and have shorter codeword length than most other variable length codes for values of 4 or more for the finite integers.

Original languageEnglish
Title of host publication2009 Picture Coding Symposium, PCS 2009
DOIs
Publication statusPublished - 2009 Nov 23
Event2009 Picture Coding Symposium, PCS 2009 - Chicago, IL, United States
Duration: 2009 May 62009 May 8

Other

Other2009 Picture Coding Symposium, PCS 2009
CountryUnited States
CityChicago, IL
Period09/5/609/5/8

Fingerprint

Mathematical transformations
Uncertainty

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Hong, S., Eom, M., & Choe, Y. (2009). Variable-length code based on an order complexity. In 2009 Picture Coding Symposium, PCS 2009 [5167371] https://doi.org/10.1109/PCS.2009.5167371
Hong, Soongi ; Eom, Minyoung ; Choe, Yoonsik. / Variable-length code based on an order complexity. 2009 Picture Coding Symposium, PCS 2009. 2009.
@inproceedings{28ec7cdaa58e4d0597aaa225f1718b9b,
title = "Variable-length code based on an order complexity",
abstract = "In this paper, we introduce new codeword sets based on order complexity (OC) which measures uncertainty of the order having each permutation string. The proposed codeword sets are generated by two procedures: Indexing and B-transform. Indexing is that a smaller positive integer is mapped to a permutation string whose OC is lower. B-transform plays role of generating a binary string from the permutation string on reflecting the OC, that is, low OC is represented by short binary strings and high OC is represented by long binary strings. The sets of these binary strings are our proposed codeword sets (B-codes). The B-codes are the uniquely decipherable complete variable length codeword sets and have shorter codeword length than most other variable length codes for values of 4 or more for the finite integers.",
author = "Soongi Hong and Minyoung Eom and Yoonsik Choe",
year = "2009",
month = "11",
day = "23",
doi = "10.1109/PCS.2009.5167371",
language = "English",
isbn = "9781424445943",
booktitle = "2009 Picture Coding Symposium, PCS 2009",

}

Hong, S, Eom, M & Choe, Y 2009, Variable-length code based on an order complexity. in 2009 Picture Coding Symposium, PCS 2009., 5167371, 2009 Picture Coding Symposium, PCS 2009, Chicago, IL, United States, 09/5/6. https://doi.org/10.1109/PCS.2009.5167371

Variable-length code based on an order complexity. / Hong, Soongi; Eom, Minyoung; Choe, Yoonsik.

2009 Picture Coding Symposium, PCS 2009. 2009. 5167371.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Variable-length code based on an order complexity

AU - Hong, Soongi

AU - Eom, Minyoung

AU - Choe, Yoonsik

PY - 2009/11/23

Y1 - 2009/11/23

N2 - In this paper, we introduce new codeword sets based on order complexity (OC) which measures uncertainty of the order having each permutation string. The proposed codeword sets are generated by two procedures: Indexing and B-transform. Indexing is that a smaller positive integer is mapped to a permutation string whose OC is lower. B-transform plays role of generating a binary string from the permutation string on reflecting the OC, that is, low OC is represented by short binary strings and high OC is represented by long binary strings. The sets of these binary strings are our proposed codeword sets (B-codes). The B-codes are the uniquely decipherable complete variable length codeword sets and have shorter codeword length than most other variable length codes for values of 4 or more for the finite integers.

AB - In this paper, we introduce new codeword sets based on order complexity (OC) which measures uncertainty of the order having each permutation string. The proposed codeword sets are generated by two procedures: Indexing and B-transform. Indexing is that a smaller positive integer is mapped to a permutation string whose OC is lower. B-transform plays role of generating a binary string from the permutation string on reflecting the OC, that is, low OC is represented by short binary strings and high OC is represented by long binary strings. The sets of these binary strings are our proposed codeword sets (B-codes). The B-codes are the uniquely decipherable complete variable length codeword sets and have shorter codeword length than most other variable length codes for values of 4 or more for the finite integers.

UR - http://www.scopus.com/inward/record.url?scp=70449633558&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449633558&partnerID=8YFLogxK

U2 - 10.1109/PCS.2009.5167371

DO - 10.1109/PCS.2009.5167371

M3 - Conference contribution

SN - 9781424445943

BT - 2009 Picture Coding Symposium, PCS 2009

ER -

Hong S, Eom M, Choe Y. Variable-length code based on an order complexity. In 2009 Picture Coding Symposium, PCS 2009. 2009. 5167371 https://doi.org/10.1109/PCS.2009.5167371