Linear Universal Decoding for Compound Channels
Name
Abbe-2010-Linear Universal Dec.pdf
Size
327.78 KB
Format
Adobe PDF
Checksum (MD5)
a90394ccd765aab7563d7ebc814b1e4d
Author(s)
Abbe, Emmanuel A.
Zheng, Lizhong
Date Issued
November 2010
Journal
IEEE transactions on information theory
Publisher
Institute of Electrical and Electronics Engineers / IEEE Information Theory Society
Citation
Abbe, Emmanuel, and Lizhong Zheng. “Linear Universal Decoding for Compound Channels.” IEEE Transactions on Information Theory 56.12 (2010) : 5999-6013. Copyright © 2010, IEEE
Version
Final published version
Abstract
Over discrete memoryless channels (DMC), linear decoders (maximizing additive metrics) afford several nice properties. In particular, if suitable encoders are employed, the use of decoding algorithms with manageable complexities is permitted. For a compound DMC, decoders that perform well without the channel's knowledge are required in order to achieve capacity. Several such decoders have been studied in the literature, however, there is no such known decoder which is linear. Hence, the problem of finding linear decoders achieving capacity for compound DMC is addressed, and it is shown that under minor concessions, such decoders exist and can be constructed. A geometric method based on the very noisy transformation is developed and used to solve this problem.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tit.2010.2080910
