The search of Type I codes
Carolin Hannusch, Roland S. Major
TL;DR
This paper investigates properties of Type I self-dual binary linear codes, develops a computer-based search program, and presents new computational results to enhance understanding of these codes.
Contribution
It introduces a new computer-aided method for searching Type I codes and provides novel computational findings for codes of various lengths.
Findings
New properties of Type I codes identified
A computer program for code search developed and implemented
Computational results for specific code lengths obtained
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Error Correcting Code Techniques · graph theory and CDMA systems