Minimum-distance bounds for binary linear codes

DOI10.1109/TIT.1973.1055009MaRDI QIDQ5681912zbMATH OpenFDO

Authors Hermann Josef Helgert, Russell D. Stinaff

Publication date 1973

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1973.1055009

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(12)

• An improvement of the Griesmer bound for some small minimum distances
• Algebraic theory of block codes detecting independent errors
• Optimal ternary linear codes
• Some binary maximin distance designs
• On a signal processing algorithms based class of linear codes
• Linear representations of cotriangular spaces
• Linearly embeddable designs
• 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
• Some Constructions for Convolutional and Block Codes
• Tables of coverings for decoding by \(S\)-sets
• On the classification and enumeration of self-dual codes

This page was built for publication: Minimum-distance bounds for binary linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5681912)