Please use this identifier to cite or link to this item:
|Author:||D'Oliveira, Rafael G. L.|
|Abstract:||We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder. We also show that any metric, up to a decoding equivalence, can be isometrically embedded into the hypercube with the Hamming metric, and thus, in terms of decoding, the Hamming metric is universal. (C) 2018 Elsevier Ltd. All rights reserved|
|Appears in Collections:||IMECC - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.