On metric dimension of nonbinary Hamming spaces

DOI10.1134/S0032946018010040zbMath1467.94035OpenAlexW2802062956WikidataQ129988789 ScholiaQ129988789MaRDI QIDQ2190917

Grigory Kabatiansky, Vladimir Lebedev

Publication date: 23 June 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946018010040

Mathematics Subject Classification ID

Applications of graph theory (05C90) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications of graph theory to circuits and networks (94C15)

Related Items (3)

On the metric dimension of Cartesian powers of a graph ⋮ Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem

Cites Work

• Mastermind
• Construction of signature codes and the coin weighing problem
• Coding for T-user multiple-access channels
• Probability Inequalities for Sums of Bounded Random Variables
• On a Combinatorial Problem in Number Theory
• Determination of a Subset from Certain Combinatorial Properties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On metric dimension of nonbinary Hamming spaces