2013/09/24 by Jonathan Scarlett, Scarlett, Jonathan · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Cellular Automata and Applications #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1309.6200
openalex publication_date 2013/09/24 · openalex created_date 2022/08/16 · openalex updated_date 2026/07/28
This paper studies second-order coding rates for memoryless channels with a\nstate sequence known non-causally at the encoder. In the case of finite\nalphabets, an achievability result is obtained using constant-composition\nrandom coding, and by using a small fraction of the block to transmit the type\nof the state sequence. For error probabilities less than 1/2, it is shown that\nthe second-order rate improves on an existing one based on i.i.d. random\ncoding. In the Gaussian case (dirty paper coding) with an almost-sure power\nconstraint, an achievability result is obtained used using random coding over\nthe surface of a sphere, and using a small fraction of the block to transmit a\nquantized description of the state power. It is shown that the second-order\nasymptotics are identical to the single-user Gaussian channel of the same input\npower without a state.\n