J. Borges, J. Rifà, V. A. Zinoviev, “On completely regular codes”, Probl. Peredachi Inf., 2019, Volume 55, Issue 1,Pages <nobr>3

This article is cited in 24 papers

Coding Theory

On completely regular codes

J. Borges^a, J. Rifà^a, V. A. Zinoviev^b

^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.

UDC: 621.391.15

Received: 22.12.2018
Revised: 06.02.2019
Accepted: 11.02.2019

DOI: 10.1134/S0134347519010017