|
Problemy Peredachi Informatsii, 2018, Volume 54, Issue 1, Pages 54–62
(Mi ppi2259)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Coding Theory
On metric dimension of nonbinary Hamming spaces
G. A. Kabatianskya, V. S. Lebedevb a Skolkovo Institute of Science and Technology, Moscow, Russia
b Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Abstract:
For $q$-ary Hamming spaces we address the problem of the minimum number of points such that any point of the space is uniquely determined by its (Hamming) distances to them. It is conjectured that for a fixed $q$ and growing dimension $n$ of the Hamming space this number asymptotically behaves as $2n/\log_qn$. We prove this conjecture for $q=3$ and $q=4$; for $q=2$ its validity has been known for half a century.
Received: 10.12.2017 Revised: 25.12.2017
Citation:
G. A. Kabatiansky, V. S. Lebedev, “On metric dimension of nonbinary Hamming spaces”, Probl. Peredachi Inf., 54:1 (2018), 54–62; Problems Inform. Transmission, 54:1 (2018), 48–55
Linking options:
https://www.mathnet.ru/eng/ppi2259 https://www.mathnet.ru/eng/ppi/v54/i1/p54
|
|