A Computer Search for N1L-Configurations
Information Theory
2008-05-05 v1 math.IT
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.
Cite
@article{arxiv.0805.0173,
title = {A Computer Search for N1L-Configurations},
author = {Martin Dowd},
journal= {arXiv preprint arXiv:0805.0173},
year = {2008}
}
Comments
submitted to IEEE Trans. Information Theory. 5 pages