On Metric Dimension of Nonbinary Hamming Spaces-Reference-Cited by-同舟云学术

On Metric Dimension of Nonbinary Hamming Spaces

Published:2018-01 Issue:1 Volume:54 Page:48-55
ISSN:0032-9460
Container-title:Problems of Information Transmission
language:en
Short-container-title:Probl Inf Transm

Author:

Kabatiansky G. A.,Lebedev V. S.

Publisher

Pleiades Publishing Ltd

Subject

Computer Networks and Communications,Computer Science Applications,Information Systems

Link

http://link.springer.com/article/10.1134/S0032946018010040/fulltext.html

Reference13 articles.

1. Harary, F. and Meter, R.A., On the Metric Dimension of a Graph, Ars Combin., 1976, vol. 2, pp. 191–195.

2. Slater, P., Leaves on Trees, Proc. 6th Southeastern Conf. on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, Feb. 17–20, 1975), Hoffman, F., Mullin, R.C., Levow, R.B., Roselle, D., Stanton, R.G., and Thomas, R.S.D., Eds., Congr. Numer., vol. XIV, Winnipeg: Utilitas Math., 1975, pp. 549–599.

3. Erdős, P. and Rényi, A., On Two Problems of Information Theory, Magyar Tud. Akad. Mat. Kutató Int. Közl., 1963, vol. 8, pp. 241–254.

4. Erdős, P. and Spencer, J., Probabilistic Methods in Combinatorics, Budapest: Acad. Kiadó, 1974. Translated under the title Veroyatnostnye metody v kombinatorike, Moscow: Mir, 1976.

5. Lindström, B., On a Combinatory Detection Problem. I, Magyar Tud. Akad. Mat. Kutató Int. Közl., 1964, vol. 9, pp. 195–207.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Signature Codes for a Noisy Adder Multiple Access Channel;2022 IEEE Information Theory Workshop (ITW);2022-11-01

2. Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory;Problems of Information Transmission;2022-10

3. On the metric dimension of Cartesian powers of a graph;Journal of Combinatorial Theory, Series A;2019-07