TY - JOUR
T1 - Linear universal decoding for compound channels
AU - Abbe, Emmanuel
AU - Zheng, Lizhong
N1 - Funding Information:
Manuscript received September 30, 2008; revised July 25, 2010. Date of current version November 19, 2010. This work was supported by the National Science Foundation under Grant CIF-0830100. The authors are with the Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02129 USA (e-mail: [email protected]; [email protected]). Communicated by I. Kontoyiannis, Associate Editor for Shannon Theory. Digital Object Identifier 10.1109/TIT.2010.2080910
PY - 2010/12
Y1 - 2010/12
N2 - 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.
AB - 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.
KW - Additive decoders
KW - compound channels
KW - hypothesis testing
KW - information geometry
KW - mismatch
KW - universal decoders
UR - http://www.scopus.com/inward/record.url?scp=78649380826&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78649380826&partnerID=8YFLogxK
U2 - 10.1109/TIT.2010.2080910
DO - 10.1109/TIT.2010.2080910
M3 - Article
AN - SCOPUS:78649380826
SN - 0018-9448
VL - 56
SP - 5999
EP - 6013
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 12
M1 - 5625623
ER -