This paper studies the error exponent of block coding over an additive white Gaussian noise channel where a fraction (f) of the channel output symbols are revealed to the transmitter through noiseless feedback. If the code rate exceeds fC, where C is the channel capacity, then the probability of decoding error cannot decay faster than exponentially with block length. However, if the code rate is below fC, the error probability can decrease faster than exponentially with the block length, as with full feedback (f=1). This is achieved by combining a feedback code and a forward error control code, and jointly decoding them at the receiver. This scheme can attain higher reliability than rate splitting in which feedback and forward codes independently encode separate source messages.
- Error exponent
- Schalkwijk-Kailath (SK) coding
- random coding exponent
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences