Abstract | ||
---|---|---|
For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This finding completes the characterization of the third-order term for symmetric discrete memoryless channels. The proof method is extended to asymmetric and singular channels with constant composition codes, and its connection to existing results, as well as its limitation in the error exponents regime, are discussed. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1109/ISIT.2014.6875163 | Information Theory |
Keywords | Field | DocType |
approximation theory,information theory,telecommunication channels,constant composition codes,error exponents,normal approximation,proof method,singular channels,singular discrete memoryless channel,symmetric discrete memoryless channel,symmetric discrete memoryless channels,third-order term | Discrete mathematics,Computer science,Third order,Communication channel,Pure mathematics,Normal approximation | Conference |
Volume | Citations | PageRank |
abs/1309.5126 | 8 | 0.63 |
References | Authors | |
14 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yucel Altug | 1 | 77 | 8.76 |
Aaron B. Wagner | 2 | 322 | 37.39 |