Pages that link to "Item:Q1308431"

The following pages link to Irving S. Reed (Q1308431):

Displaying 50 items.

• (Q209606) (redirect page) (← links)
• Generalized de Moivre's theorem, quaternions, and Lorentz transformations on a Minkowski space (Q1308432) (← links)
• A brief history of the development of error correcting codes (Q1570097) (← links)
• Reflections, spinors, and projections on a Minkowski space underlie Dirac's equation (Q1913658) (← links)
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
• The Mellin type of double integral (Q2653313) (← links)
• Image data compression using cubic convolution spline interpolation (Q2713791) (← links)
• A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform (Q3206263) (← links)
• A VLSI Design of a Pipeline Reed-Solomon Decoder (Q3220490) (← links)
• Polynomial Codes Over Certain Finite Fields (Q3280459) (← links)
• (Q3285930) (← links)
• The Detection of Radar Echoes in Noise. I (Q3289418) (← links)
• Systolic Multipliers for Finite Fields GF(2^m) (Q3309615) (← links)
• (Q3313961) (← links)
• A Parallel Architecture for Digital Filtering Using Fermat Number Transforms (Q3318687) (← links)
• The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier Algorithm (Q3337374) (← links)
• Fourier analysis and signal processing by use of the Mobius inversion formula (Q3479962) (← links)
• Algebraic decoding of the (32, 16, 8) quadratic residue code (Q3489942) (← links)
• On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays (Q3495185) (← links)
• A theorem for computing primitive elements in the field of complex integers of a characteristic Mersenne prime (Q3673055) (← links)
• On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution (Q3674013) (← links)
• A fast algorithm for computing a complex-number theoretic transform for long sequences (Q3674015) (← links)
• An improved FPT algorithm for computing two-dimensional cyclic convolutions (Q3678633) (← links)
• Recursive FIR digital filter design using a<tex>z</tex>-transform on a finite ring (Q3682379) (← links)
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m) (Q3682399) (← links)
• The VLSI Design of an Error-Trellis Syndrome Decoder for Certain Convolutional Codes (Q3731520) (← links)
• A Complex Integer Multiplier Using the Quadratic-Polynomial Residue Number System with Numbers of Form 2²ⁿ+ 1 (Q3786392) (← links)
• A pipeline design of a fast prime factor DFT on a finite field (Q3795179) (← links)
• (Q3843994) (← links)
• A fast computation of complex convolution using a hybrid transform (Q3867129) (← links)
• A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime (Q3870263) (← links)
• A VLSI design for a trace-back Viterbi decoder (Q4004669) (← links)
• The algebraic decoding of the (41, 21, 9) quadratic residue code (Q4008330) (← links)
• A VLSI architecture for simplified arithmetic Fourier transform algorithm (Q4008684) (← links)
• The use of finite fields to compute convolutions (Q4054637) (← links)
• Complex integer convolutions over a direct sum of Galois fields (Q4072796) (← links)
• Galois Switching Functions and Their Applications (Q4087079) (← links)
• Convolutions over residue classes of quadratic integers (Q4107436) (← links)
• Integer Convolutions over the Finite Field $GF( {3 \cdot 2^n + 1} )$ (Q4132627) (← links)
• Correction to 'Convolutions over Residue Classes of Quadratic Integers' (Q4138061) (← links)
• Image Processing by Transforms Over a Finite Field (Q4138621) (← links)
• A transform decoder for Reed-Solomon codes in multiple-user communication systems (Q4140848) (← links)
• Inner Product Computers (Q4146257) (← links)
• The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions (Q4149662) (← links)
• Multichannel convolutional coding systems over a direct sum of Galois fields (Q4154479) (← links)
• Recursive realization of finite impulse filters using finite field arithmetic (Q4160803) (← links)
• The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.) (Q4166692) (← links)
• On the Fundamental Structure of Galois Switching Functions (Q4168533) (← links)
• Comparative performance analysis of adaptive multispectral detectors (Q4277073) (← links)
• A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes (Q4307279) (← links)