Weight enumerators of codes derived from polynomial product algorithms
From MaRDI portal
Publication:1356476
DOI10.1016/S0012-365X(96)00241-5zbMath0869.94032MaRDI QIDQ1356476
Publication date: 9 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
- On a signal processing algorithms based class of linear codes
- A new approach to error-correcting codes
- On the number of multiplications necessary to compute certain functions
- Unnamed Item
- Unnamed Item
This page was built for publication: Weight enumerators of codes derived from polynomial product algorithms