Minimum-distance bounds for binary linear codes
From MaRDI portal
Publication:5681912
DOI10.1109/TIT.1973.1055009zbMath0265.94007MaRDI QIDQ5681912
Russell D. Stinaff, Hermann Josef Helgert
Publication date: 1973
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (12)
An improvement of the Griesmer bound for some small minimum distances ⋮ Linearly embeddable designs ⋮ Algebraic theory of block codes detecting independent errors ⋮ On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius ⋮ On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes ⋮ Tables of coverings for decoding by S-sets ⋮ Optimal ternary linear codes ⋮ On the classification and enumeration of self-dual codes ⋮ On a signal processing algorithms based class of linear codes ⋮ Some binary maximin distance designs ⋮ Linear representations of cotriangular spaces ⋮ Some Constructions for Convolutional and Block Codes
This page was built for publication: Minimum-distance bounds for binary linear codes
