Name
Abstract | ||
|---|---|---|
In this paper, we consider one-to-one encodings for a discrete memoryless source, which are "one-shot encodings associating a distinct codeword with each source symbol. Such encodings could be employed when only a single source symbol rather than a sequence of source symbols needs to be transmitted. We consider two slightly different types of one-to-one encodings depending on whether the empty codeword is used or not. Given that the probability of the most likely source symbol is available, we provide several new lower and upper bounds on the expected length of optimal one-to-one codes. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/DCC.2006.52 | DCC |
Keywords | Field | DocType |
upper bounds,discrete memoryless source,distinct codeword,likely source symbol,different type,empty codeword,single source symbol,new lower,optimal one-to-one codes,source symbol,expected length,one-to-one encodings,optimal one-to-one code,entropy,random variables,source coding,concatenated codes,channel coding,upper bound,single source,decoding | Concatenated error correction code,Random variable,Computer science,Symbol,Source code,Upper and lower bounds,One-to-one,Algorithm,Theoretical computer science,Code word,Decoding methods | Conference |
ISSN | ISBN | Citations |
1068-0314 | 0-7695-2545-8 | 1 |
PageRank | References | Authors |
0.37 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jay Cheng | 1 | 34 | 4.73 |
| Tien-Ke Huang | 2 | 21 | 2.98 |