Cited By
View all- Sommerhalder R(1975)On the number of automorphisms of non-cyclic automataÜber die Zahl der Automorphismen eines nicht zyklischen AutomatenComputing10.1007/BF0224237115:3(247-250)Online publication date: Sep-1975
Let 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 ...
The only example of a binary doubly-even self-dual [120,60,20] code was found in 2005 by Gaborit et al. (IEEE Trans Inform theory 51 , 402---407 2005). In this work we present 25 new binary doubly-even self-dual [120,60,20] codes having an automorphism ...
All singly-even self-dual [40,20,8] binary codes which have an automorphism of prime order p \geq 5 are obtained up to equivalence. There are two inequivalent codes with an automorphism of order 7 and 37 inequivalent codes with an automorphism of order ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in