On the Assmus–Mattson type theorem for Type I and even formally self-dual codes

08/18/2022
by   Tsuyoshi Miezaki, et al.
0

In the present paper, we give the Assmus–Mattson type theorem for near-extremal Type I and even formally self-dual codes. We show the existence of 1-designs or 2-designs for these codes. As a corollary, we prove the uniqueness of a self-orthogonal 2-(16,6,8) design.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2023

A note on t-designs in isodual codes

In the present paper, we construct 3-designs using extended binary quadr...
research
04/11/2020

On the existence of s-extremal singly even self-dual codes

We construct new s-extremal singly even self-dual codes of minimum weigh...
research
06/11/2022

Neighborhoods of binary self-dual codes

In this paper, we introduce the neighborhood of binary self-dual codes. ...
research
07/18/2023

Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31

A classification of Hadamard matrices of order 2p+2 with an automorphism...
research
04/06/2020

Strengthening of the Assmus–Mattson theorem for some dual codes

We previously proposed the first nontrivial examples of a code having su...
research
07/30/2018

Coherent Explicit Dictionary Application for Haskell: Formalisation and Coherence Proof

Type classes are one of Haskell's most popular features and extend its t...
research
10/18/2021

The search of Type I codes

A self-dual binary linear code is called Type I code if it has singly-ev...

Please sign up or login with your details

Forgot password? Click here to reset