On the minimality of Hamming compatible metrics
Information Theory
2012-01-10 v1 math.IT
Abstract
A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere with respect to this metric, and show this metric is minimal in the class of all "well-behaved" Hamming compatible metrics.
Keywords
Cite
@article{arxiv.1201.1633,
title = {On the minimality of Hamming compatible metrics},
author = {Parsa Bakhtary and Othman Echi},
journal= {arXiv preprint arXiv:1201.1633},
year = {2012}
}
Comments
9 pages