Variable-Length Code Based on Order Complexity and Its Application in Random Permuted Symbol

• HONG Soongi

  Department of Electrical & Electronic Engineering, Yonsei University

• JIN Honglin

  School of Information Engineering, Yancheng Institute of Technology

• KIM Yong-Goo

  Department of Newmedia, Korean German Institute of Technology

• CHOE Yoonsik

  Department of Electrical & Electronic Engineering, Yonsei University

抄録

This paper introduces the concept of order complexity, which represents the minimum number of partial ordering operations to make a string of perfectly ordered symbols. A novel variable-length code expressing such order complexity using binary digits is proposed herein. The proposed code is general, uniquely decipherable, and useful for coding a string of random permuted symbols having unknown statistics or which are preferred to have a uniform distribution.

収録刊行物

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E96.A (7), 1657-1661, 2013

  一般社団法人 電子情報通信学会

キーワード

• variable-length code
• order complexity
• codes for unknown statistics
• uniform distribution source

詳細情報

• CRID: 1390001206310518656
• NII論文ID: 130003370697
• DOI: 10.1587/transfun.e96.a.1657
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E96.A/7/E96.A_1657/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可