A bound for divisible codes

DOI10.1109/18.108271MaRDI QIDQ3991411zbMATH OpenOpenAlexFDO

Authors Harold N. Ward

Publication date 28 June 1992

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

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

zbMATH Keywords

Conway-Sloane bounddivisible codelinear codeself-dual codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• The divisible code bound revisited
• An introduction to divisible codes
• Divisible codes
• scientific article; zbMATH DE number 1767697

Cited in

(19)

• Divisible codes
• Divisibility of codes meeting the Griesmer bound
• Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables
• Bounds on the rate of separating codes
• Characters and the equivalence of codes
• An introduction to divisible codes
• Codes with a certain weight-preserving transitive group of automorphisms
• Upper Bounds on Separating Codes
• Weights Modulo a Prime Power in Divisible Codes and a Related Bound
• scientific article; zbMATH DE number 1767697 (Why is no real title available?)
• On the Codes Generated by Certain Divisible Designs
• Monomial-Cartesian codes closed under divisibility
• The divisible code bound revisited
• Binomial moments for divisible self-dual codes
• Binary divisible codes of maximum dimension
• A selection of divisible lexicographic codes
• An equivalence of Ward's bound and its application
• Lengths of divisible codes with restricted column multiplicities
• A generalized Gleason-Pierce-Ward theorem

This page was built for publication: A bound for divisible codes

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