On a signal processing algorithms based class of linear codes

DOI10.1007/BF01270399MaRDI QIDQ1803557zbMATH OpenFDO

Authors Hari Krishna

Publication date 29 June 1993

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

zbMATH Keywords

bilinear formslinear codesmultiplicative complexitygenerator matrixaperiodic convolution algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 194254
• A new approach to error-correcting codes
• Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
• Bilinear forms and linear codes
• scientific article; zbMATH DE number 3458474

Cites work

• scientific article; zbMATH DE number 3880785 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3514983 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A new approach to error-correcting codes
• A new structured design method for convolutions over finite fields, Part I
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• Minimum-distance bounds for binary linear codes

Cited in

(2)

• Weight enumerators of codes derived from polynomial product algorithms
• Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems

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

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