13 citations · 26 across the 15 of their papers we have counts for
9 papers · 1 filter
A concatenation construction for propelinear perfect codes from regular subgroups of GA(r,2)
I. Yu. Mogilnykh, F. I. Solov'eva
A code is called propelinear if there is a subgroup of of order acting transitively on the codewords of . In the paper new propelinear perfect binary codes of…
On components of a Kerdock code and the dual of the BCH code
I. Yu. Mogilnykh, F. I. Solov'eva
In the paper we investigate the structure of -components of two classes of codes: Kerdock codes and the duals of the primitive cyclic BCH code with designed distance 5 of length…
On maximum components of a class of perfect codes
I. Yu. Mogilnykh, F. I. Solov'eva
In the paper we show the existence of a large class of extended perfect binary codes containing maximum ij-components.
On homogeneous nontransitive binary perfect code
I. Yu. Mogilnykh, F. I. Solov'eva
Studying binary perfect codes we show the existence of homogeneous nontransitive codes. Thus, as far as perfect codes are concerned, the propelinear codes are strictly contained in…
Transitive nonpropelinear perfect codes
I. Yu. Mogilnykh, F. I. Solov'eva
A code is called transitive if its automorphism group (the isometry group) of the code acts transitively on its codewords. If there is a subgroup of the automorphism group acting r…
On the number of nonequivalent propelinear extended perfect codes
J. Borges, I. Yu. Mogilnykh, J. Rifà +1
The paper proves that there exist an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that al…