Bounds on generalized weights

DOI10.1007/3-540-57843-9_28MaRDI QIDQ4954433zbMATH OpenFDO

Authors Gérard Cohen, L. Huguet, Gilles Zémor

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57843-9_28

Mathematics Subject Classification ID

Bounds on codes (94B65)

Review text

We derive upper bounds on the generalized distances of linear codes by adapting the classical bounds of coding theory. Section 3 deals with lower bounds with special emphasis on BCH codes. For the entire collection see [Zbl 0866.00068].

Recommendations

• New upper bounds on generalized weights
• Bounds on the weight hierarchy of generalized concatenated codes
• scientific article; zbMATH DE number 1009722
• Upper bounds on generalized distances
• Generalized Hamming weights of trace codes

Cited in

(12)

• A generalization of Kung's theorem
• Generalized rank weights: A duality statement
• scientific article; zbMATH DE number 3950372 (Why is no real title available?)
• scientific article; zbMATH DE number 1009722 (Why is no real title available?)
• Supports of a code
• scientific article; zbMATH DE number 1150277 (Why is no real title available?)
• Generalizations of the Griesmer bound
• scientific article; zbMATH DE number 2163546 (Why is no real title available?)
• New upper bounds on generalized weights
• Bounds on the minimum support weights
• Upper bounds on generalized distances
• On the generalized weights of a class of trace codes

This page was built for publication: Bounds on generalized weights

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