On Completely Regular Codes


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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 ρ = 2 and on extended completely regular codes.

About the authors

J. Borges

Department of Information and Communications Engineering, School of Engineering

Author for correspondence.
Email: joaquim.borges@uab.cat
Spain, Barcelona

J. Rifà

Department of Information and Communications Engineering, School of Engineering

Author for correspondence.
Email: josep.rifa@uab.cat
Spain, Barcelona

V. A. Zinoviev

Kharkevich Institute for Information Transmission Problems

Author for correspondence.
Email: zinov@iitp.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Pleiades Publishing, Inc.