Back to Search
Start Over
On binary 1-perfect additive codes: some structural properties
- Source :
- IEEE Transactions on Information Theory. Sept, 2002, Vol. 48 Issue 9, p2587, 6 p.
- Publication Year :
- 2002
-
Abstract
- The rank and kernel of 1-perfect additive codes is determined. Additive codes could be seen as translation-invariant propelinear codes and, in this correspondence, a characterization of propelinear codes as codes having a regular subgroup of the full group of isometries of the code is established. A characterization of the automorphism group of a 1-perfect additive code is given and also the cardinality of this group is computed. Finally, an efficiently computable characterization of the Steiner triple systems associated with a 1-perfect binary additive code is also established. Index Terms--Additive codes, automorphism group, kernel, 1-perfect codes, rank.
- Subjects :
- Information theory -- Models
Codes -- Analysis
Subjects
Details
- ISSN :
- 00189448
- Volume :
- 48
- Issue :
- 9
- Database :
- Gale General OneFile
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.91398782