Reducing the number of operations in certain finite- field transforms (Corresp.)
type: Item
instance of: scholarly article
title: Reducing the number of operations in certain finite- field transforms (Corresp.)
zbMATH Open document ID: 0541.94031
DOI: 10.1109/TIT.1984.1056908
author: David M. Mandelbaum
published in: IEEE Transactions on Information Theory
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 3861066
zbMATH Keywords: finite-field transforms
zbMATH Keywords: discrete Fourier transform
zbMATH Keywords: Reed-Solomon codes
zbMATH Keywords: BCH codes
zbMATH Keywords: sparse polynomials
zbMATH Keywords: Goertzel transform
zbMATH Keywords: Winograd transform
MaRDI profile type: MaRDI publication profile
full work available at URL: tit.1984.1056908
OpenAlex ID: W2120394846
Recommended article: Transforms, Finite Fields, and Fast Multiplication
Recommended article: Q3835685
Recommended article: On the complexity of matrix reduction over finite fields
Recommended article: Fast transforms over finite fields of characteristic two
Recommended article: Q5464322
Recommended article: A method for fast computation of the Fourier transform over a finite field
Recommended article: Operation-efficient subgroups of finite fields
Recommended article: Finite field trigonometric transforms
Recommended article: Complexity Reduction of Constant Matrix Computations over the Binary Field
Recommended article: Simultaneous modular reduction and Kronecker substitution for small finite fields
description: scientific article; zbMATH DE number 3861066