A Computer Search for N1L-Configurations

Simple item page
dc.creatorDowd, Martin
dc.date2008-05-02
dc.date.accessioned2026-07-07T09:36:37Z
dc.date.available2026-07-07T09:36:37Z
dc.descriptionIn 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.
dc.descriptionsubmitted to IEEE Trans. Information Theory. 5 pages
dc.identifierhttps://arxiv.org/abs/0805.0173
dc.identifierhttp://arxiv.org/abs/0805.0173
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160185
dc.subjectInformation Theory
dc.titleA Computer Search for N1L-Configurations
dc.typetext

Files

Collections

arXiv