2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/139947This 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.10 pages, 3 tablesInformation TheoryH.1.1; E.4text