On the dispersion of dirty paper coding

This paper studies the second-order asymptotics of the coding rate for a given error probability in the setting of dirty paper coding (Costa, 1983) with an almost-sure power constraint. It is shown that the dispersion is the same as if the state sequence were absent, thus strengthening the analogous capacity result. The result holds under mild technical conditions on the state sequence, and is not limited to the ergodic case.