Abstract
We call a set B a base of a metric space L if every point of L is uniquely determined by its distances to the points of B.
The minimal possible number of points of a base is called the rigidity of the metric space and is denoted by r(L).
n-dimensional q-ary Hamming space is denoted by H n,q .
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aigner, M.: Combinatorial Search (1988)
Cantor, D.G., Mills, W.H.: Determination of a subset from certain combinatorial properties. Can. J. Math. 18, 42–48 (1966)
Chvatal, V.: Mastermind. Combinatorica 3, 325–329 (1983)
Erdos, P., Renyi, A.: On two problems of information theory. Publ. Math. Inst. Hung. Acad. Sci. 8, 241–254 (1963)
Lindstrom, B.: On a combinatory detection problem 1. Publ. Math. Inst. Hung. Acad. Sci. 9, 195–207 (1964)
Lindstrom, B.: On a combinatorial problem in number theory. Can. Math. Bull. 8, 477–490 (1965)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lebedev, V.S. (2006). The Rigidity of Hamming Spaces. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_78
Download citation
DOI: https://doi.org/10.1007/11889342_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)