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

Publication series

Name2009 Picture Coding Symposium, PCS 2009

Other

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

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Variable-length code based on an order complexity'. Together they form a unique fingerprint.

  • 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] (2009 Picture Coding Symposium, PCS 2009). https://doi.org/10.1109/PCS.2009.5167371