13 citations · 26 across the 15 of their papers we have counts for
16 papers
Coordinate transitivity of extended perfect codes and their SQS
I. Yu. Mogilnykh, F. I. Solov'eva
We continue the study of the class of binary extended perfect propelinear codes constructed in the previous paper and consider their permutation automorphism (symmetry) groups and…
On existence of perfect bitrades in Hamming graphs
I. Yu. Mogilnykh, F. I. Solov'eva
A pair of disjoint sets of vertices of a graph is called a perfect bitrade in if any ball of radius 1 in contains exactly one vertex in and or n…
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 transitive uniform partitions of F^n into binary Hamming codes
Faina I. Solov'eva
We investigate transitive uniform partitions of the vector space of dimension over the Galois field into cosets of Hamming codes. A partition $P^n= \{H_0,H_1+e_1,…
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.