Lower bounds on the minimum average distance of binary codes

Simple item page
dc.creatorMounits, Beniamin
dc.date2007-06-22
dc.date.accessioned2026-07-07T08:16:09Z
dc.date.available2026-07-07T08:16:09Z
dc.descriptionNew lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/0706.3295
dc.identifierhttp://arxiv.org/abs/0706.3295
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133685
dc.subjectInformation Theory
dc.subjectCombinatorics
dc.titleLower bounds on the minimum average distance of binary codes
dc.typetext

Files

Collections

arXiv