DOIAbstract
AbstractAll permutation groups which are realizable as the groups of finite elementary codes are completely determined
AbstractAll permutation groups which are realizable as the groups of finite elementary codes are completely determined
Algebraic structure of codes closed under arbitrary abelian group G of permutations is investigated ...
There is a close correspondence between the set of subgroups of a finite group G and the set of ineq...
Non UBCUnreviewedAuthor affiliation: New York City College of Technology, City University of New Yor...
SIGLEAvailable from British Library Document Supply Centre- DSC:D37875/81 / BLDSC - British Library ...
AbstractIn this paper we prove the every finite group is isomorphic to the full automorphism group o...
Available from British Library Document Supply Centre- DSC:DXN057712 / BLDSC - British Library Docum...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN040419 / BLDSC - British Library D...
For group codes over elementary Abelian groups we present definitions of the generator and the parit...
A finite group is said to be admissible if it has a permutation mapping of the form g → θ(g) such th...
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of f...
The work covers the finite simple groups. The aim is to find the basic parameters for minimal permut...
The study of finite groups factorised as a product of two or more subgroups has become a subject of ...
After introducing permutation notation and defining group, the author discusses the simpler properti...
Groups arise in several different categories in Magma. In the case of the category of permutation gr...
Abstract. Motivated by issues arising in computer science, we inves-tigate the loop-free paths from ...
Algebraic structure of codes closed under arbitrary abelian group G of permutations is investigated ...
There is a close correspondence between the set of subgroups of a finite group G and the set of ineq...
Non UBCUnreviewedAuthor affiliation: New York City College of Technology, City University of New Yor...
SIGLEAvailable from British Library Document Supply Centre- DSC:D37875/81 / BLDSC - British Library ...
AbstractIn this paper we prove the every finite group is isomorphic to the full automorphism group o...
Available from British Library Document Supply Centre- DSC:DXN057712 / BLDSC - British Library Docum...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN040419 / BLDSC - British Library D...
For group codes over elementary Abelian groups we present definitions of the generator and the parit...
A finite group is said to be admissible if it has a permutation mapping of the form g → θ(g) such th...
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of f...
The work covers the finite simple groups. The aim is to find the basic parameters for minimal permut...
The study of finite groups factorised as a product of two or more subgroups has become a subject of ...
After introducing permutation notation and defining group, the author discusses the simpler properti...
Groups arise in several different categories in Magma. In the case of the category of permutation gr...
Abstract. Motivated by issues arising in computer science, we inves-tigate the loop-free paths from ...
Algebraic structure of codes closed under arbitrary abelian group G of permutations is investigated ...
There is a close correspondence between the set of subgroups of a finite group G and the set of ineq...
Non UBCUnreviewedAuthor affiliation: New York City College of Technology, City University of New Yor...
Add to ORKG