Back to the index. Or to the chambers
This article has 12 links. View as Cloud or List.
| 1 | Frame |
| 1 | Superset |
| 1 | Group Action |
| 1 | Group |
| 1 | Subgroup |
| 3 | Finite Field |
| 4 | Code |
| 5 | Stabilizer |
| 5 | Orbit |
| 6 | Permutation Matrix |
| 7 | Linear Code |
| 11 | Monomial Matrix |
Loading ...
Planetmath Browser (2008—2009)
BSD licence | A django site
All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.
→ The original article on PlanetMath.org
Other Formats: LaTeX
Automorphism Group Linear Code
Let
be the finite field
with
elements. The group
of
monomial matrices
with entries in
acts on
the set
of linear codes
over
of
block length
via the monomial transform: let
and
and set
![]() |
Two linear codes lying in the same orbit
with respect to this action
are said to be equivalent. The isotropy subgroup
of
is its automorphism group, denoted by
. The elements
of
are the automorphisms of
.
Sometimes one is only interested in the action of the permutation
matrices
on
. The permutation matrices form a subgroup
of
and the resulting subgroup of the automorphism group
of a linear code
is called the
permutation group. In the case of binary codes, this doesn't
make any difference, since the finite field
contains
only
one nonzero element.
