An Algorithm for Classification of Binary Self-Dual Codes
Stefka Bouyuklieva, Iliya Bouyukliev
TL;DR
This paper introduces an efficient algorithm for classifying binary self-dual codes and applies it to completely classify all such codes of length 38.
Contribution
The paper presents a novel algorithm that enables the complete classification of binary self-dual codes of a given length, specifically length 38.
Findings
Complete classification of self-dual codes of length 38
Algorithm improves classification efficiency
Provides a new tool for code theory research
Abstract
An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is 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.