Notes on conditional entropy and commitment capacity

DOI10.37190/0208-4147.00246MaRDI QIDQ6919571zbMATH OpenFDO

Authors Nemanja Nedić, Mladen Kovačević, Darko Čapko, S. Vukmirović

Publication date 8 October 2025

Published in Probability and Mathematical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37190/0208-4147.00246

zbMATH Keywords

Blahut-Arimoto algorithmcommitment capacityconditional entropyequivocation

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Cryptography (94A60)

Cites work

• An algorithm for computing the capacity of arbitrary discrete memoryless channels
• Coin flipping by telephone a protocol for solving impossible problems
• Commitment capacity of classical-quantum channels
• Computation of channel capacity and rate-distortion functions
• Elements of Information Theory
• scientific article; zbMATH DE number 3872359 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• Information-theoretic Cryptography
• On the Commitment Capacity of Unfair Noisy Channels
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• The empirical distribution of good codes

This page was built for publication: Notes on conditional entropy and commitment capacity

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