Results 321 to 330 of about 12,641,387 (374)
(n, n(n-1), n-1) Permutation group codes
Electronics Letters, 2016 Two different subgroups C n and L n of symmetric group S n are first designed and then to construct a family of permutation group codes P n with code length n, minimum Hamming distance n − 1, cardinalityn(n − 1) and error-correcting capability n − 2 is ...
Li Peng
semanticscholar +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Solving the Single-Row Facility Layout Problem by K-Medoids Memetic Permutation Group
IEEE Transactions on Evolutionary Computation, 2023The single-row facility layout problem (SRFLP) is concerned with arranging facilities along a straight line so as to minimize the sum of the products of the flow costs and distances among all facility pairs.
Lixin Tang, Zuo-cheng Li, Jin-Kao Hao
semanticscholar +1 more source
Communications in Algebra, 2004
Abstract In this paper an algorithm is produced, which, given a permutation group G of degree n > 3, outputs a generating set for G with at most n/2 elements.
A. Lucchini, F. Menegazzo, MORIGI, MARTA
openaire +2 more sources
Abstract In this paper an algorithm is produced, which, given a permutation group G of degree n > 3, outputs a generating set for G with at most n/2 elements.
A. Lucchini, F. Menegazzo, MORIGI, MARTA
openaire +2 more sources
On the diameter of permutation groups
Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83, 1983Computer Science ...
James R. Driscoll, Merrick L. Furst
openaire +2 more sources
Application of Permutation Group Theory in Reversible Logic Synthesis
International Workshop on Reversible Computation, 2015The paper discusses various applications of permutation group theory in the synthesis of reversible logic circuits consisting of Toffoli gates with negative control lines.
D. Zakablukov
semanticscholar +1 more source
Permutability in uncountable groups
Annali di Matematica Pura ed Applicata (1923 -), 2018A subgroup X of a group G is called permutable if $$XY=YX$$ for all subgroups Y of G. It is well known that permutable subgroups play an important role in many problems in group theory, and the purpose of ...
Maria De Falco +3 more
openaire +3 more sources
Isometries for rank distance and permutation group of Gabidulin codes
IEEE Transactions on Information Theory, 2003The rank distance was introduced by E.M. Gabidulin (see Probl. Pered. Inform., vol.21, p.1-12, 1985). He determined an upper bound for the minimum rank distance of a code.
T. Berger
semanticscholar +1 more source
Free Wreath Product by the Quantum Permutation Group
, 2001Let A be a compact quantum group, let n∈N* and let Aaut(Xn) be the quantum permutation group on n letters. A free wreath product construction A*wAaut(Xn) is introduced.
J. Bichon
semanticscholar +1 more source
The permutation group of affine-invariant extended cyclic codes
IEEE Transactions on Information Theory, 1996The extended cyclic codes of length p/sup m/, p is a prime, which are invariant under the affine-group acting on F/sub pm/, are called affine-invariant codes.
T. Berger, P. Charpin
semanticscholar +1 more source
The Parallel Complexity of Abelian Permutation Group Problems
SIAM journal on computing (Print), 1987We classify Abelian permutation group problems with respect to their parallel complexity. For such groups specified by generating permutations we show that testing membership, computing order and testing isomorphism are $NC^1 $-equivalent to (and ...
P. McKenzie, S. Cook
semanticscholar +1 more source