A Note on Bounded-Weight Error-Correcting Codes

dc.creatorBent,Russell
dc.creatorSchear,Michael
dc.creatorHemaspaandra,Lane
dc.creatorIstrate,Gabriel
dc.date1999
dc.date.accessioned2024-02-06T12:50:18Z
dc.date.available2024-02-06T12:50:18Z
dc.descriptionThis paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting codes, and evaluate the differences.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-005-12-0817
dc.identifierhttps://lib.jucs.org/article/27617/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7662
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 5(12): 817-827
dc.subjecterror-correcting codes
dc.subjectbounded-weight codes
dc.subjectconstant-weight codes
dc.subjectexperimental algorithms
dc.subjectheuristic algorithms
dc.subjectexact solutions
dc.titleA Note on Bounded-Weight Error-Correcting Codes
dc.typeResearch Article
Файлы