Embedding Distances into the Hamming Cube - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Embedding Distances into the Hamming Cube


In Coding Theory, two different decision criteria types are mostly used: a maximal likelihood (relative to a probabilistic model of a channel) and a nearest neighbour criterion (relative to a distance model of the channel). In this work we present an algorithm that, given a maximal likelihood criterion, decides if there is a nearest neighbour criterion that matches it and, in this case, produces a metric that determines such a criterion. It is also shown that the Hamming metric is universal, in the sense that any metric, up to a decoding equivalence, can be isometrically embedded into a hypercube with the Hamming metric.
Fichier principal
Vignette du fichier
wcc15-th3-1.pdf (236.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01276469 , version 1 (19-02-2016)


  • HAL Id : hal-01276469 , version 1


Rafael Gregorio Lucas d'Oliveira, Marcelo Firer. Embedding Distances into the Hamming Cube. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01276469⟩


71 View
258 Download


Gmail Facebook X LinkedIn More