Results 141 to 150 of about 173,309,485 (168)
Some of the next articles are maybe not open access.
On automorphism groups of certain Goppa codes
Designs, Codes and Cryptography, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Massimo Giulietti, Gábor Korchmáros
openaire +1 more source
Automorphisms of Extremal Self-Dual Codes
IEEE Transactions on Information Theory, 2010Let C be a binary extremal self-dual code of length n ? 48. We prove that for each ? ? Aut(C) of prime order p ? 5 the number of fixed points in the permutation action on the coordinate positions is bounded by the number of p-cycles. It turns out that large primes p, i.e., n-p small, seem to occur in |Aut(C)| very rarely.
Stefka Bouyuklieva
exaly +2 more sources
On the Weights of Linear Codes With Prescribed Automorphisms
IEEE Transactions on Information TheoryzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gaojun Luo +3 more
openaire +3 more sources
Affine Automorphism Group of Polar Codes
IEEE Transactions on Information TheoryzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zicheng Ye +5 more
openaire +2 more sources
The automorphism groups of the Delsarte-Goethals codes
Designs, Codes and Cryptography, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On the Automorphism Group of Generalized Hermitian Codes
IEEE Transactions on Information Theory, 2013We determine the full automorphism group of the Generalized Hermitian curve, denoted by GH, which generalizes the Hermitian curve. The automorphism group of a code is important in Coding Theory, and in this way, we determine completely the automorphism group of the one-point AG codes over the GH curve.
Alonso Sepúlveda Castellanos +1 more
openaire +1 more source
On Binary Self-Dual Codes With Automorphisms
IEEE Transactions on Information Theory, 2008In this correspondence, we present some results concerning a decomposition of binary self-dual codes possessing an automorphism of certain type. Two applications are given. The first one is the classification of all extremal doubly even self-dual codes of length having an automorphism of order .
exaly +2 more sources
Codes with simple automorphism groups, II
Archiv der Mathematik, 1978For primesl≧ 11 of the form 2m+1,m an odd prime, the automorphism group of the extended (l+1, (l+1)/2) quadratic residue code overGF(q) is simple. If the automorphism group properly containsPSL 2 (l), then for all primes of the above form the stability group of a point is simple. Application is made to the casesl=7, 11 and 23.
openaire +1 more source
On the Automorphism Groups of Affine-Invariant Codes.
Designs, Codes and Cryptography, 1996Let \(A\) be a group code. An affine-invariant code is a group code which is invariant under the action of the affine group \(AGL (1, p^m)\). If \(C\) denotes a cyclic code of length \(p^m - 1\) over a finite field \(K\) the extended code \(\overline C\) is an affine-invariant code if and only if its permutation group (the permutations acting on the ...
openaire +3 more sources
Automorphisms of Constant Weight Codes and of Divisible Designs
Designs, Codes and Cryptography, 2000After showing how to construct a constant weight code \(C(D)\) from a divisible design \(D\), the authors study how the automorphism groups of \(D\) and \(C(D)\) are related. The main result is the following: Aut\((D)\) induces a faithful group of automorphisms on \(C(D)\), which either is equal to Aut\((C(D))\) or has index equal to \(2\) in Aut\((C(D)
Ralph-Hardo Schulz +1 more
openaire +2 more sources