13 citations · 26 across the 15 of their papers we have counts for
6 papers · 1 filter
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…
Self-embeddings of Hamming Steiner triple systems of small order and APN permutations
J. Rifà, F. I. Solov'eva, M. Villanueva
The classification, up to isomorphism, of all self-embedding monomial power permutations of Hamming Steiner triple systems of order n=2^m-1 for small m, m < 23, is given. As far as…
Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs
Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen +1
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A cons…
Construction of Z4-linear Reed-Muller codes
J. Pujol, J. Rifá, F. I. Solov'eva
New quaternary Plotkin constructions are given and are used to obtain new families of quaternary codes. The parameters of the obtained codes, such as the length, the dimension and…
On the intersection of additive perfect codes
J. Rifà, F. Solov'eva, M. Villanueva
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive co…