New results on binary linear codes

Simple item page
dc.creatorJaffe, David B.
dc.date1995-08-14
dc.date.accessioned2026-07-07T08:18:17Z
dc.date.available2026-07-07T08:18:17Z
dc.descriptionThis research announcement describes in very rough terms methods and a computer language under development, which can be used to prove the nonexistence of binary linear codes. Over a hundred new results have been obtained by the author. For example, there is no [29,11,10] code. The proof of this is roughly outlined.
dc.identifierhttps://arxiv.org/abs/math/9508219
dc.identifierhttp://arxiv.org/abs/math/9508219
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134382
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subject94B65
dc.titleNew results on binary linear codes
dc.typetext

Files

Collections

arXiv