New upper bounds on generalized weights

DOI10.1109/18.761280MaRDI QIDQ4701380zbMATH OpenOpenAlexFDO

Authors Alexei Ashikhmin, Alexander Barg, Simon Litsyn

Publication date 21 November 1999

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

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

zbMATH Keywords

asymptotic upper boundsbinary linear codeconstant-weight codesdistance distributiongeneralized weightslinear programming

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1456833
• scientific article; zbMATH DE number 1009722
• Upper bounds on generalized distances
• scientific article; zbMATH DE number 3478749
• Bounds on the weight hierarchy of generalized concatenated codes

Cited in

(14)

• Weight spectra of some codes
• GHWs of codes arising from Cartesian product of graphs
• An upper bound on the weight distribution of some systematic codes (Corresp.)
• scientific article; zbMATH DE number 4047601 (Why is no real title available?)
• scientific article; zbMATH DE number 3478749 (Why is no real title available?)
• scientific article; zbMATH DE number 1009722 (Why is no real title available?)
• Estimates of the distance distribution of codes and designs
• Upper bounds on generalized distances
• scientific article; zbMATH DE number 1456833 (Why is no real title available?)
• On the generalisation of Sidel'nikov's theorem to q-ary linear codes
• A note onm-weights of linear codes
• Extrapolation of weights revisited: new proofs and sharp bounds
• The weight hierarchies of linear codes from simplicial complexes
• The weight hierarchies of three classes of linear codes

This page was built for publication: New upper bounds on generalized weights

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