Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness

DOI10.1109/TIT.2008.928985MaRDI QIDQ3604897zbMATH OpenOpenAlexFDO

Authors Masahito Hayashi

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0503089

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: Second order asymptotics of fixed-length source coding and intrinsic randomness is discussed with a constant error constraint. There was a difference between optimal rates of fixed-length source coding and intrinsic randomness, which never occurred in the first order asymptotics. In addition, the relation between uniform distribution and compressed data is discussed based on this fact. These results are valid for general information sources as well as independent and identical distributions. A universal code attaining the second order optimal rate is also constructed.

Recommendations

• Theorems on the variable-length intrinsic randomness
• Source codes as random number generators
• Second-order noiseless source coding theorems
• Generating random bits from an arbitrary source: fundamental limits
• Fixed-rate universal lossy source coding and rates of convergence for memoryless sources

Cited in

(10)

• Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution
• Second-order coding rates for pure-loss bosonic channels
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
• Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources
• Decoding quantum information via the Petz recovery map
• Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker
• Common Information, Noise Stability, and Their Extensions
• Fundamental finite key limits for one-way information reconciliation in quantum key distribution
• Random tensor networks with non-trivial links

This page was built for publication: Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604897)