scientific article; zbMATH DE number 4110626

From MaRDI portal
Publication:3833995





[For the entire collection see Zbl 0671.00023.] This paper presents in a clear, coincise and smart manner the concept of e-covering and the study of propelinear code structure associated with distance-regular e-latticed graphs. The first two sections don't have new results but they contain the background for the completely regular codes and distance-regular graphs. The results of section 3 about e-covering are used for the next (section 4) where the authors define the propelinear code structure. There are given the main properties and characteristics of the algebraic structure of completely regular codes (not necessarily linear). Taking into account the study of algebraic structure of codes constructed from distance regular e-latticed graphs (section 5) in the last section, the authors present their major contribution. They prove: From a propelinear code C it is possible to construct an associated graph \(\Omega\) (C); C is a completely regular code if and only if \(\Omega\) (C) is a distance-regular graph. This result is a generalization of an analogues result obtained for restricted linear codes. Although the development of the theory is algebraic its prototype operation and the results are well suitable for other types of codes.




Cited in
(27)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833995)