## Abstract

Let (Formula presented.) be an extremal binary doubly even self-dual code of length (Formula presented.) and (Formula presented.) be the support design of (Formula presented.) for a weight (Formula presented.). We introduce the two numbers (Formula presented.) and (Formula presented.) : (Formula presented.) is the largest integer (Formula presented.) such that, for all wight, (Formula presented.) is a (Formula presented.) -design; (Formula presented.) denotes the largest integer (Formula presented.) such that there exists a (Formula presented.) such that (Formula presented.) is a (Formula presented.) -design. In this paper, we consider the possible values of (Formula presented.) and (Formula presented.).

Original language | English |
---|---|

Pages (from-to) | 37-46 |

Number of pages | 10 |

Journal | Designs, Codes, and Cryptography |

Volume | 79 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2016 Apr 1 |

Externally published | Yes |

## Keywords

- Assmus–Mattson theorem
- Harmonic weight enumerators
- Self-dual codes
- t-Designs

## ASJC Scopus subject areas

- Computer Science Applications
- Applied Mathematics