AI Chat AI Image Generator AI Video Text to Speech

The search of Type I codes

10/18/2021

∙

by Carolin Hannusch, et al.

∙

∙

A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e. it has codewords with weight divisible by 2. The purpose of this paper is to investigate interesting properties of Type I codes of different lengths. Further, we build up a computer-based code-searching program based on our knowledge about Type I codes. Some computation results achieved by this program are given.

Carolin Hannusch
5 publications
Roland S. Major
1 publication

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/11/2022

Neighborhoods of binary self-dual codes

In this paper, we introduce the neighborhood of binary self-dual codes. ...

0 Carolin Hannusch, et al. ∙

research

∙ 01/10/2020

Searching a Database of Source Codes Using Contextualized Code Search

We assume a database containing a large set of program source codes and ...

0 Rohan Mukherjee, et al. ∙

research

∙ 07/27/2017

Providing Self-Aware Systems with Reflexivity

We propose a new type of self-aware systems inspired by ideas from highe...

0 Alessandro Valitutti, et al. ∙

research

∙ 06/18/2023

Ternary extremal four-negacirculant self-dual codes

In this note, we give basic properties of ternary four-negacirculant sel...

0 Masaaki Harada, 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. ∙