AI Chat AI Image Generator AI Video Text to Speech

Neighborhoods of binary self-dual codes

06/11/2022

∙

by Carolin Hannusch, et al.

∙

∙

In this paper, we introduce the neighborhood of binary self-dual codes. Further, we show that for codelength divisible by 8 such a neighborhood consists of three self-dual codes, two of them are doubly-even and one is always singly-even. We investigate the relationship between neighboring codes. Finally, we prove that no better Type I code exists than the best possible Type II code of the same length.

Carolin Hannusch
5 publications
S. Roland Major
2 publications

page 1

page 2

page 3

page 4

research

∙ 01/05/2022

Construction of extremal Type II ℤ_2k-codes

We give methods for constructing many self-dual ℤ_m-codes and Type II ℤ_...

0 Masaaki Harada, et al. ∙

research

∙ 06/21/2021

On decoding of a specific type of self-dual codes

This work introduces a decoding strategy for binary self-dual codes poss...

0 Radinka Yorgova, et al. ∙

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...

0 Carolin Hannusch, et al. ∙

research

∙ 05/03/2021

Type IV-II codes over Z4 constructed from generalized bent functions

A Type IV-II Z4-code is a self-dual code over Z4 with the property that ...

0 Sara Ban, et al. ∙

research

∙ 08/18/2022

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

In the present paper, we give the Assmus–Mattson type theorem for near-e...

0 Tsuyoshi Miezaki, et al. ∙

research

∙ 10/10/2018

On components of a Kerdock code and the dual of the BCH code C_1,3

In the paper we investigate the structure of i-components of two classes...

0 I. Yu. Mogilnykh, et al. ∙

research

∙ 07/02/2022

Derivatives of Complete Weight Enumerators and New Balance Principle of Binary Self-Dual Codes

Let H be the standard Hadamard matrix of order two and let K=2^-1/2H. It...

0 Vassil Yorgov, et al. ∙