On a signal processing algorithms based class of linear codes

DOI10.1007/BF01270399zbMATH Open0774.94006MaRDI QIDQ1803557FDOQ1803557

Authors: Hari Krishna 

Publication date: 29 June 1993

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new approach to error-correcting codes
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• Title not available (Why is that?)
• A new structured design method for convolutions over finite fields, Part I
• Minimum-distance bounds for binary linear codes

Cited In (2)

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

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)