Split Weight Enumerators for the Preparata Codes with Applications to Designs

Iwan Duursma, Tor Helleseth, Chunming Rong, Kyeongcheol Yang

Research output: Contribution to journalArticlepeer-review

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 languageEnglish (US)
Pages (from-to)103-124
Number of pages22
JournalDesigns, Codes, and Cryptography
Volume18
Issue number1-3
DOIs
StatePublished - Dec 1999
Externally publishedYes

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

Fingerprint

Dive into the research topics of 'Split Weight Enumerators for the Preparata Codes with Applications to Designs'. Together they form a unique fingerprint.

Cite this