Coding for the Large-Alphabet Adversarial Channel

DOI10.1109/TIT.2017.2725280MaRDI QIDQ4566497zbMATH OpenOpenAlexFDO

Authors Ebad Ahmed, Aaron B. Wagner

Publication date 27 June 2018

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

Full work available at URL https://doi.org/10.1109/tit.2017.2725280

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60)

Recommendations

• Capacity of random channels with large alphabets
• Adversarial Network Coding
• Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets
• A large deviation theory proof of the abstract alphabet source coding theorem
• scientific article; zbMATH DE number 51447
• Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel
• Large Alphabet Source Coding Using Independent Component Analysis
• Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint
• Approximative coding methods for channel representations
• On the decoding of convolutional codes on an unknown channel

Cited in

(2)

• Large Alphabet Source Coding Using Independent Component Analysis
• Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint

This page was built for publication: Coding for the Large-Alphabet Adversarial Channel

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