The search of Type I codes
Information Theory
2021-10-19 v1 Mathematical Software
math.IT
Abstract
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 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.
Keywords
Cite
@article{arxiv.2110.09244,
title = {The search of Type I codes},
author = {Carolin Hannusch and Roland S. Major},
journal= {arXiv preprint arXiv:2110.09244},
year = {2021}
}