|
This article is cited in 23 scientific papers (total in 23 papers)
Coding Theory
On completely regular codes
J. Borgesa, J. Rifàa, V. A. Zinovievb a Department of Information and Communications Engineering, School of Engineering, Universitat Autonoma de Barcelona, Bellaterra, Barcelona, Spain
b Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Abstract:
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures, and construction methods are considered. The existence problem is also discussed, and known results for some particular cases are established. In addition, we present several new results on completely regular codes with covering radius $\rho=2$ and on extended completely regular codes.
Received: 22.12.2018 Revised: 06.02.2019 Accepted: 11.02.2019
Citation:
J. Borges, J. Rifà, V. A. Zinoviev, “On completely regular codes”, Probl. Peredachi Inf., 55:1 (2019), 3–50; Problems Inform. Transmission, 55:1 (2019), 1–45
Linking options:
https://www.mathnet.ru/eng/ppi2283 https://www.mathnet.ru/eng/ppi/v55/i1/p3
|
Statistics & downloads: |
Abstract page: | 348 | Full-text PDF : | 82 | References: | 36 | First page: | 17 |
|