Abstract
For quaternary Preparata and Kerdock codes of length N = 2m, m odd, we prove that the split complete weight enumerator for a coordinate partition into 3 and N - 3 coordinates is independent of the chosen partition. The result implies that the words of a given complete weight in either a Preparata code or Kerdock code define a 3-design.
Original language | English (US) |
---|---|
Pages (from-to) | 103-124 |
Number of pages | 22 |
Journal | Designs, Codes, and Cryptography |
Volume | 18 |
Issue number | 1-3 |
DOIs | |
State | Published - Dec 1999 |
Externally published | Yes |
Keywords
- 3-Design
- Kerdock Code
- Preparata Code
- Split weight enumerator
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics