2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/160185In 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.submitted to IEEE Trans. Information Theory. 5 pagesInformation TheoryA Computer Search for N1L-Configurationstext