Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ar��kan, Erdal"'
Autor:
Ar��kan, Erdal
A packing lemma is proved using a setting where the channel is a binary-input discrete memoryless channel $(\mathcal{X},w(y|x),\mathcal{Y})$, the code is selected at random subject to parity-check constraints, and the decoder is a joint typicality de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94b6d71ac610e6617ba407874c0f1e54
http://arxiv.org/abs/1504.05793
http://arxiv.org/abs/1504.05793
