A Computer Search for N1L-Configurations
Martin Dowd
TL;DR
This paper presents a computer search for N1L-configurations to gather evidence supporting a conjecture that could improve the sphere-packing bound for linear double error-correcting codes.
Contribution
It introduces a computational approach to investigate N1L-configurations, providing empirical evidence related to a conjecture impacting coding theory bounds.
Findings
Evidence supporting the conjecture on N1L-configurations
Potential improvements to the sphere-packing bound
Identification of specific configurations relevant to the conjecture
Abstract
In an earlier paper the author defined N1L configurations, and stated a conjecture concerning them which would lead to an improvement by a constant factor to the sphere-packing bound for linear double error correcting codes. Here a computer search is presented, in an effort to gather evidence on the conjecture.
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 · graph theory and CDMA systems · Algorithms and Data Compression