Abstract
We consider transmission over a discrete memoryless channel (DMC) W(y\x) with finite alphabets X and Y. It is assumed that an (n, Mn)-codebook Mn = [x1,..., xMn} with rate Rn = 1/n log Mn is used for transmission. The type-dependent maximum-metric decoder estimates the transmitted message as m = arg maxxiMn q(Pxi, y), (1) where xy is the joint empirical distribution [1, Ch. 2] of the pair (x, y) and the metric q : P(X × Y) → R is continuous. Maximum-likelihood (ML) decoding is a special case of (1), but the decoder may in general be mismatched [2], [3].
Original language | English |
---|---|
Title of host publication | 2018 52nd Annual Conference on Information Sciences and Systems, CISS 2018 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 1-2 |
Number of pages | 2 |
ISBN (Electronic) | 9781538605790 |
DOIs | |
State | Published - 21 May 2018 |
Event | 52nd Annual Conference on Information Sciences and Systems, CISS 2018 - Princeton, United States Duration: 21 Mar 2018 → 23 Mar 2018 |
Publication series
Name | 2018 52nd Annual Conference on Information Sciences and Systems, CISS 2018 |
---|
Conference
Conference | 52nd Annual Conference on Information Sciences and Systems, CISS 2018 |
---|---|
Country/Territory | United States |
City | Princeton |
Period | 21/03/18 → 23/03/18 |
Bibliographical note
Publisher Copyright:© 2018 IEEE.