An introduction to divisible codes (Q1963169)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An introduction to divisible codes |
scientific article; zbMATH DE number 1392728
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An introduction to divisible codes |
scientific article; zbMATH DE number 1392728 |
Statements
An introduction to divisible codes (English)
0 references
24 January 2000
0 references
A linear code is called divisible if all codeword weights have a nontrivial common divisor. The author presents in this paper some basic facts about divisible codes, culminating in a ``divisible'' version of the Gleason-Pierce theorem on self-dual codes.
0 references
divisible codes
0 references
Gleason-Pierce theorem
0 references
self-dual codes
0 references
0 references
0 references
0.89264345
0 references
0 references
0.88164663
0 references
0 references
