Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/PCS.2009.5167371 | PCS |
Keywords | Field | DocType |
proposed codeword set,codeword set,high oc,shorter codeword length,permutation string,short binary string,long binary string,new codeword,low oc,order complexity,binary string,variable-length code,indexation,uncertainty measurement,computational complexity,encoding,prefix code,data mining,out of order,indexing,variable length code,binary codes,completeness,bubble sort,probability distribution,measurement uncertainty | Integer,Discrete mathematics,Combinatorics,Parity-check matrix,Permutation,Binary code,Theoretical computer science,Code word,Bubble sort,Prefix code,Mathematics,Computational complexity theory | Conference |
Citations | PageRank | References |
1 | 0.63 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soongi Hong | 1 | 3 | 2.09 |
| Minyoung Eom | 2 | 16 | 2.71 |
| Yoonsik Choe | 3 | 91 | 28.68 |