# Finite-Blocklength Channel Coding Rate Under a Long-Term Power Constraint Paper in proceeding, 2014

This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in the large-n expansion of the maximal channel coding rate is characterized both for AWGN channels and for quasi-static fading channels with perfect channel state information at the transmitter and the receiver. It is shown that in both cases the second-order term is proportional to $\sqrt{(\log n)/n}$.

## Author

### Wei Yang

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

### Giuseppe Caire

University of Southern California

### Giuseppe Durisi

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

### Yury Polyanskiy

Massachusetts Institute of Technology (MIT)

#### IEEE International Symposium on Information Theory - Proceedings

21578095 (ISSN)

2067-2071 6875197
978-147995186-4 (ISBN)

Information and Communication Technology

### Subject Categories

Telecommunications

### DOI

10.1109/ISIT.2014.6875197

978-147995186-4