Publication | Closed Access
An updated table of minimum-distance bounds for binary linear codes
172
Citations
41
References
1993
Year
Mathematical ProgrammingEngineeringUpdated TableWord Length NBinary Linear CodeCoding TheoryLower BoundComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationError Correction CodeUpper BoundsVariable-length CodeAlgebraic Coding Theory
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1