Name
Title | ||
|---|---|---|
Variable-Length Code Based On Order Complexity And Its Application In Random Permuted Symbol |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1587/transfun.E96.A.1657 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
variable-length code, order complexity, codes for unknown statistics, uniform distribution source | Discrete mathematics,Self-synchronizing code,Constant-weight code,Symbol,Theoretical computer science,Linear code,Mathematics,Variable-length code | Journal |
Volume | Issue | ISSN |
E96A | 7 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soongi Hong | 1 | 3 | 2.09 |
| Hong Lin Jin | 2 | 29 | 2.46 |
| Yong Kim | 3 | 24 | 5.72 |
| Yoonsik Choe | 4 | 91 | 28.68 |