Binary codes with improved minimum weights (Corresp.)
- 1 March 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 22 (2) , 241-243
- https://doi.org/10.1109/tit.1976.1055518
Abstract
A recent table of Helgert and Stinaff gives bounds ford_{max}(n,k), the maximum minimum distance over all binary linear(n,k)error-correcting codes,1 \leq k \leq n \leq 127. Twelve new codes are constructed which improve lower bounds in the table. Two methods are employed: the algebraic puncturing technique of Solomon and Stiffler and generation by combinatorial incidence matrices.Keywords
This publication has 3 references indexed in Scilit:
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- New binary coding results by circulantsIEEE Transactions on Information Theory, 1969
- Algebraically punctured cyclic codesInformation and Control, 1965