DOIAbstract
AbstractIn this paper we prove the every finite group is isomorphic to the full automorphism group of some perfect binary single error correcting code
AbstractIn this paper we prove the every finite group is isomorphic to the full automorphism group of some perfect binary single error correcting code
The book describes developments on some well-known problems regarding the relationship between order...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
AbstractA group code structure of a linear code is a description of the code as one-sided or two-sid...
Codes are used to store and send information. In this thesis we discuss binary codes, which can be s...
AbstractAll permutation groups which are realizable as the groups of finite elementary codes are com...
We define the concept of regular partition of a graph Γ and its relationship to the automorphism gro...
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hammin...
In [1], the automorphism group of a binary linear code is computed by identifying it with one of its...
The power graph of a finite group is the graph whose vertex set is the group, two distinct elements ...
International audienceLet A be a finite or countable alphabet and let θ be a literal (anti-)automorp...
A new method for computing the automorphism group of a finite permutation group and for testing two ...
International audienceIn this paper, we describe constructions of majority logic decodable codes whi...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
Ideal group codes are defined as principal ideals in the group algebra of a finite group G over a fi...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
The book describes developments on some well-known problems regarding the relationship between order...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
AbstractA group code structure of a linear code is a description of the code as one-sided or two-sid...
Codes are used to store and send information. In this thesis we discuss binary codes, which can be s...
AbstractAll permutation groups which are realizable as the groups of finite elementary codes are com...
We define the concept of regular partition of a graph Γ and its relationship to the automorphism gro...
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hammin...
In [1], the automorphism group of a binary linear code is computed by identifying it with one of its...
The power graph of a finite group is the graph whose vertex set is the group, two distinct elements ...
International audienceLet A be a finite or countable alphabet and let θ be a literal (anti-)automorp...
A new method for computing the automorphism group of a finite permutation group and for testing two ...
International audienceIn this paper, we describe constructions of majority logic decodable codes whi...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
Ideal group codes are defined as principal ideals in the group algebra of a finite group G over a fi...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
The book describes developments on some well-known problems regarding the relationship between order...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
AbstractA group code structure of a linear code is a description of the code as one-sided or two-sid...
Add to ORKG