In Langevin and Zanotti (1995), we introduced a new class of codes called balanced weight distribution (BWD)-codes, with the remarkable property that their weight distribution is balanced, i.e., there are the same number of codewords for each non-zero weight. The aim of this paper is to study the we
Automorphism Groups of BWD-codes
โ Scribed by J.-P. Zanotti
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 261 KB
- Volume
- 78
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
If n G 3 and F is free of rank n, then Out Aut F s Out Out F s 1 . n n n แฎ 2000 Academic Press n is an isomorphism. Tits's theorem leads to a proof that the outer automor-
## Abstract A picture is a simple graph together with an edgeโcoloring, such that each vertex is incident with exactly one edge of each color. An automorphism of a picture is a graph automorphism that preserves the colors of the edges. We show that every group is isomorphic to the full automorphism
For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms. As an application we present new examples of 1ร2-transitive and 1-regular graphs.
The automorphism group of a generic cubic surface is trivial M. Kostabashi, J. x Algebra 116 130แ142 . In this article, we determine the automorphism group of each nonsingular cubic surface.