On a signal processing algorithms based class of linear codes

DOI10.1007/BF01270399zbMath0774.94006MaRDI QIDQ1803557

Hari Krishna

Publication date: 29 June 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

linear codesbilinear formsmultiplicative complexitygenerator matrixaperiodic convolution algorithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (1)

Weight enumerators of codes derived from polynomial product algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• A new approach to error-correcting codes
• A new structured design method for convolutions over finite fields, Part I
• Minimum-distance bounds for binary linear codes

This page was built for publication: On a signal processing algorithms based class of linear codes