Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel
Abstract
This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's combinatorial central limit theorem, an inner bound on the set of locally achievable second-order coding rates is given for each point on the boundary of the capacity region. It is shown that the inner bound for constant-composition random coding includes that recovered by i.i.d. random coding, and that the inclusion may be strict. The inner bound is extended to the Gaussian multiple-access channel via an increasingly fine quantization of the inputs.
Cite
@article{arxiv.1303.6167,
title = {Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel},
author = {Jonathan Scarlett and Alfonso Martinez and Albert Guillén i Fàbregas},
journal= {arXiv preprint arXiv:1303.6167},
year = {2014}
}
Comments
(v2) Results/proofs given in matrix notation, det(V)=0 handled more rigorously, Berry-Esseen derivation given. (v3) Gaussian case added (v4) Significant change of presentation; added local dispersion results; added new method to obtain non-standard tangent vector terms using coded time-sharing; (v5) Final version (IEEE Transactions on Information Theory)