scientific article; zbMATH DE number 4110626
[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.
- Completely regular codes
- Quasi-Hadamard full propelinear codes
- Hadamard full propelinear codes of type Q; rank and kernel
- Propelinear codes related to some classes of optimal codes
- On the number of nonequivalent propelinear extended perfect codes
- On Hadamard full propelinear codes with associated group \(C_{2t}\times C_2\)
- On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
- Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
- On separability of the classes of homogeneous and transitive perfect binary codes
- Butson full propelinear codes
- About a class of Hadamard propelinear codes
- Characterizing completely regular codes from an algebraic viewpoint
- scientific article; zbMATH DE number 4072866 (Why is no real title available?)
- scientific article; zbMATH DE number 4104861 (Why is no real title available?)
- scientific article; zbMATH DE number 17837 (Why is no real title available?)
- Completely transitive codes and distance transitive graphs
- Translation-invariant propelinear codes
- Transitive nonpropelinear perfect codes
- Coverings and distance-regular graphs
- scientific article; zbMATH DE number 6665189 (Why is no real title available?)
- STS-graphs of perfect codes mod kernel
- Constructions of transitive Latin hypercubeatin hypercubes
- On completely regular codes
- ℤ₂ℤ₄-additive codes as codes over rings
- On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group
- Generalized Hadamard full propelinear codes
- \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality
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)