Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On a signal processing algorithms based class of linear codes

From MaRDI portal
Publication:1803557
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1803557&oldid=14163142"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki