Results

**1 - 6**of**6**### An equipartition property for high-dimensional log-concave distributions

"... Abstract-A new effective equipartition property for logconcave distributions on high-dimensional Euclidean spaces is described, and some applications are sketched. ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract-A new effective equipartition property for logconcave distributions on high-dimensional Euclidean spaces is described, and some applications are sketched.

### New Non-asymptotic Random Channel Coding Theorems

"... Abstract—New non-asymptotic random coding theorems (with error probability ɛ and finite block length n) based on Gallager parity check ensemble are established for binary input arbitrary output channels. The resulting non-asymptotic achievability bounds, when combined with non-asymptotic equipartiti ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—New non-asymptotic random coding theorems (with error probability ɛ and finite block length n) based on Gallager parity check ensemble are established for binary input arbitrary output channels. The resulting non-asymptotic achievability bounds, when combined with non-asymptotic equipartition properties, can be easily computed. Analytically, these non-asymptotic achievability bounds are shown to be asymptotically tight up to the second order of the coding rate as n goes to infinity with either constant or sub-exponentially decreasing ɛ. Numerically, they are also compared favourably, for finite n and ɛ of practical interest, with existing non-asymptotic achievability bounds in the literature in general. Index Terms—Channel capacity, non-asymptotic coding theorems, non-asymptotic equipartition properties, random linear codes, Gallager parity check ensemble. I.

### 1Jar Decoding: Non-Asymptotic Converse Coding Theorems, Taylor-Type Expansion, and Optimality

, 2012

"... ar ..."

(Show Context)
### The Redundancy of Slepian-Wolf Coding Revisited

"... Abstract—[Draft] In this paper, the redundancy of Slepian Wolf coding is revisited. Applying the random binning and converse technique in [6], the same results in [5] are obtained with much simpler proofs. Moreover, our results reflect more details about the high-order terms of the coding rate. The ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—[Draft] In this paper, the redundancy of Slepian Wolf coding is revisited. Applying the random binning and converse technique in [6], the same results in [5] are obtained with much simpler proofs. Moreover, our results reflect more details about the high-order terms of the coding rate. The redundancy is investigated for both fixed-rate and variable-rate cases. The normal approximation (or dispersion) can also be obtained with minor modification. I.