Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-13T10:14:16.808Z Has data issue: false hasContentIssue false

On minimal Hamming compatible distances

Published online by Cambridge University Press:  05 November 2014

Parsa Bakhtary
Affiliation:
(Data Scientist) Facebook, Inc. Menlo Park, CA 94025, USA.. bakhtary@gmail.com
Othman Echi
Affiliation:
King Fahd University of Petroleum and Minerals, Department of Mathematics and Statistics PO Box 5046, Dhahran 31261, Saudi Arabia.; othechi@yahoo.com; echi@kfupm.edu.sa

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A Hamming compatible metric is an integer-valued metric on the words of a finite alphabetwhich agrees with the usual Hamming distance for words of equal length. We define a newHamming compatible metric and show this metric is minimal in the class of all“well-behaved” Hamming compatible metrics. This gives a negative answer to a questionstated by Echi in his paper [O. Echi, Appl. Math. Sci. (Ruse) 3(2009) 813–824.].

Information

Type
Research Article
Copyright
© EDP Sciences 2014