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

スポンサーリンク

概要

• 論文の詳細を見る

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

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• Kim Yong-Goo

  Department of Electrical and Electronics Engineering, Yonsei University

• CHOE Yoonsik

  Department of Electrical & Electronic Engineering, Yonsei University

• KIM Yong-Goo

  Department of Newmedia, Korean German Institute of Technology

• HONG Soongi

  Department of Electrical & Electronic Engineering, Yonsei University

• JIN Honglin

  School of Information Engineering, Yancheng Institute of Technology

• HONG Soongi

  Department of Electrical & Electronic Engineering, Yonsei University

関連論文

• An efficient skip mode competition scheme based on vector clustering and object boundary detection
• A directional deblocking filter based on intra prediction for H.264/AVC
• Reversible Data Hiding Based on Adaptive Modulation of Statistics Invertibility
• Selective intra-prediction Skip Algorithm for inter-frame coding in H.264/AVC
• Investigation of Device Performance and Negative Bias Temperature Instability of Plasma Nitrided Oxide in Nanoscale p-Channel Metal–Oxide–Semiconductor Field-Effect Transistor’s
• Enhanced Film Grain Noise Removal and Synthesis for High Fidelity Video Coding
• Variable-Length Code Based on Order Complexity and Its Application in Random Permuted Symbol

スポンサーリンク