Universal Covertness for Discrete Memoryless Sources

DOI10.1109/TIT.2021.3091381zbMath1486.94050arXiv1808.05612OpenAlexW3173604895MaRDI QIDQ4958241

Rémi A. Chou, Aylin Yener, Matthieu Bloch

Publication date: 7 September 2021

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

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

zbMATH Keywords

polar codesShannon entropieslossless source codeconstructive low-complexity encoding and decoding

Mathematics Subject Classification ID

Source coding (94A29)

This page was built for publication: Universal Covertness for Discrete Memoryless Sources