Weight enumerators of codes derived from polynomial product algorithms

DOI10.1016/S0012-365X(96)00241-5MaRDI QIDQ1356476zbMATH OpenFDO

Authors Stuart G. Hoggar

Publication date 9 June 1997

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bilinear formsweight enumeratorslinear error-correcting code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• On some polynomials related to weight enumerators of linear codes
• Polynomial weights and code constructions
• Weight enumerators of a class of linear codes
• Generators and weights of polynomial codes
• Complete weight enumerators of a class of linear codes
• Complete weight enumerators of a class of linear codes
• The Weight Enumerator of a Class of Cyclic Codes
• Complete weight enumerators of some linear codes and their applications
• Weight enumeration of codes from finite spaces
• The weight enumerators of several classes of \(p\)-ary cyclic codes

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1008451 (Why is no real title available?)
• A new approach to error-correcting codes
• Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
• On a signal processing algorithms based class of linear codes
• On the number of multiplications necessary to compute certain functions

Cited in

(2)

• More results on the weight enumerator of product codes
• Split weight enumerators for the Preparata codes with applications to designs

This page was built for publication: Weight enumerators of codes derived from polynomial product algorithms

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