Name
Abstract | ||
|---|---|---|
In this paper, we establish some criteria to decide when a discrete memoryless channel admits a metric in such a way that the maximum likelihood decoding coincides with the nearest neighbor decoding. In particular, we prove a conjecture presented by M. Firer and J. L. Walker, establishing that every binary asymmetric channel admits a matched metric. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TIT.2018.2885782 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Measurement,Maximum likelihood decoding,Memoryless systems,Maximum likelihood detection,Additives | k-nearest neighbors algorithm,Discrete mathematics,Combinatorics,Maximum likelihood detection,Computer science,Communication channel,Maximum likelihood,Decoding methods,Conjecture,Binary number | Journal |
Volume | Issue | ISSN |
65 | 2 | 0018-9448 |
Citations | PageRank | References |
1 | 0.37 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claudio Qureshi | 1 | 10 | 4.48 |