An updated table of minimum-distance bounds for binary linear codes

摘要

Tables with lower and upper bounds for d/sub max/ (n,k), the maximum possible minimum distance of a binary linear code with word length n and dimension k, are shown.