On the minimality of Hamming compatible metrics

Details On the minimality of Hamming compatible metrics On the minimality of Hamming compatible metrics

2012-01-08

arxiv.org/abs/1201.1633v1

Computer Science

Information Theory

9 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the minimality of Hamming compatible metrics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the minimality of Hamming compatible metrics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the minimality of Hamming compatible metrics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-345