| Publication | Date of Publication | Type |
|---|
| Subspace Expansion and the Equivalence of Conjugate Direction and Multistage Wiener Filters | 2018-06-27 | Paper |
| Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) | 2005-12-05 | Paper |
| A recursive linear detection algorithm for asynchronous CDMA communication system | 2005-05-11 | Paper |
| Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders | 2003-06-30 | Paper |
| Normal bases over \(\text{GF}(q)\) | 2002-10-03 | Paper |
| Decoding the (47,24,11) quadratic residue code | 2002-08-04 | Paper |
| A brief history of the development of error correcting codes | 2001-08-05 | Paper |
| A fast encoding algorithm for fractal image compression using the DCT inner product | 2001-06-11 | Paper |
| Image data compression using cubic convolution spline interpolation | 2001-06-10 | Paper |
| A multistage representation of the Wiener filter based on orthogonal projections | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4354771 | 1997-09-17 | Paper |
| Reflections, spinors, and projections on a Minkowski space underlie Dirac's equation | 1997-03-10 | Paper |
| Decoding the (73, 37, 13) quadratic residue code | 1995-08-31 | Paper |
| No binary quadratic residue code of length 8m-1 is quasi-perfect | 1995-05-04 | Paper |
| Use of Grobner bases to decode binary cyclic codes up to the true minimum distance | 1995-03-01 | Paper |
| General principles for the algebraic decoding of cyclic codes | 1995-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314353 | 1994-12-13 | Paper |
| On the nonperiodic cyclic equivalence classes of Reed-Solomon codes | 1994-10-04 | Paper |
| A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes | 1994-10-04 | Paper |
| Comparative performance analysis of adaptive multispectral detectors | 1994-02-07 | Paper |
| Generalized de Moivre's theorem, quaternions, and Lorentz transformations on a Minkowski space | 1993-12-12 | Paper |
| A VLSI architecture for simplified arithmetic Fourier transform algorithm | 1992-09-27 | Paper |
| The algebraic decoding of the (41, 21, 9) quadratic residue code | 1992-09-27 | Paper |
| A VLSI design for a trace-back Viterbi decoder | 1992-09-27 | Paper |
| Fourier analysis and signal processing by use of the Mobius inversion formula | 1990-01-01 | Paper |
| Algebraic decoding of the (32, 16, 8) quadratic residue code | 1990-01-01 | Paper |
| On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays | 1988-01-01 | Paper |
| A pipeline design of a fast prime factor DFT on a finite field | 1988-01-01 | Paper |
| A Complex Integer Multiplier Using the Quadratic-Polynomial Residue Number System with Numbers of Form 22n+ 1 | 1987-01-01 | Paper |
| The VLSI Design of an Error-Trellis Syndrome Decoder for Certain Convolutional Codes | 1986-01-01 | Paper |
| VLSI Architectures for Computing Multiplications and Inverses in GF(2m) | 1985-01-01 | Paper |
| A VLSI Design of a Pipeline Reed-Solomon Decoder | 1985-01-01 | Paper |
| Systolic Multipliers for Finite Fields GF(2m) | 1984-01-01 | Paper |
| The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier Algorithm | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313961 | 1983-01-01 | Paper |
| An improved FPT algorithm for computing two-dimensional cyclic convolutions | 1983-01-01 | Paper |
| A Parallel Architecture for Digital Filtering Using Fermat Number Transforms | 1983-01-01 | Paper |
| Recursive FIR digital filter design using a<tex>z</tex>-transform on a finite ring | 1983-01-01 | Paper |
| On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution | 1981-01-01 | Paper |
| A theorem for computing primitive elements in the field of complex integers of a characteristic Mersenne prime | 1981-01-01 | Paper |
| A fast algorithm for computing a complex-number theoretic transform for long sequences | 1981-01-01 | Paper |
| A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform | 1979-01-01 | Paper |
| A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime | 1979-01-01 | Paper |
| A fast computation of complex convolution using a hybrid transform | 1978-01-01 | Paper |
| The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions | 1978-01-01 | Paper |
| The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.) | 1978-01-01 | Paper |
| Inner Product Computers | 1978-01-01 | Paper |
| Multichannel convolutional coding systems over a direct sum of Galois fields | 1978-01-01 | Paper |
| On the Fundamental Structure of Galois Switching Functions | 1978-01-01 | Paper |
| Integer Convolutions over the Finite Field $GF( {3 \cdot 2^n + 1} )$ | 1977-01-01 | Paper |
| Correction to 'Convolutions over Residue Classes of Quadratic Integers' | 1977-01-01 | Paper |
| Image Processing by Transforms Over a Finite Field | 1977-01-01 | Paper |
| A transform decoder for Reed-Solomon codes in multiple-user communication systems | 1977-01-01 | Paper |
| Recursive realization of finite impulse filters using finite field arithmetic | 1977-01-01 | Paper |
| Galois Switching Functions and Their Applications | 1976-01-01 | Paper |
| Convolutions over residue classes of quadratic integers | 1976-01-01 | Paper |
| The use of finite fields to compute convolutions | 1975-01-01 | Paper |
| Complex integer convolutions over a direct sum of Galois fields | 1975-01-01 | Paper |
| Boolean Difference Calculus and Fault Finding | 1973-01-01 | Paper |
| Redundancy by Coding Versus Redundancy by Replication for Failure-Tolerant Sequential Circuits | 1972-01-01 | Paper |
| Path Sensitization, Partial Boolean Difference, and Automated Fault Diagnosis | 1972-01-01 | Paper |
| The systematic selection of cyclically equivalent codes (Corresp.) | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5639635 | 1972-01-01 | Paper |
| Notes on the Arithmetic BN Modulo A Codes | 1972-01-01 | Paper |
| kth-Order Near-Orthogonal Codes (Corresp.) | 1971-01-01 | Paper |
| Coding Techniques for Failure- Tolerant Counters | 1970-01-01 | Paper |
| The equivalence of rank permutation codes to a new class of binary codes (Corresp.) | 1970-01-01 | Paper |
| Arithmetic norms and bounds of the arithmetic AN codes | 1970-01-01 | Paper |
| A Generalization of Shift-Register Sequence Generators | 1969-01-01 | Paper |
| N-orthogonal phase-modulated codes | 1966-01-01 | Paper |
| Slave Memories and Dynamic Storage Allocation | 1965-01-01 | Paper |
| A sequential test for radar detection of multiple targets (Corresp.) | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3285930 | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5721398 | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3843994 | 1962-01-01 | Paper |
| Path-invariant comma-free codes | 1962-01-01 | Paper |
| Polynomial Codes Over Certain Finite Fields | 1960-01-01 | Paper |
| The Detection of Radar Echoes in Noise. I | 1960-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5339885 | 1960-01-01 | Paper |
| A General Isomorphism Theorem for Factor Groups | 1951-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5788204 | 1948-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5785535 | 1947-01-01 | Paper |
| The Mellin type of double integral | 1944-01-01 | Paper |
| On the Solution of a General Transform | 1944-01-01 | Paper |
