| Publication | Date of Publication | Type |
|---|
| Particle-velocity coarray augmentation for direction finding with acoustic vector sensors | 2024-09-30 | Paper |
| Coarray polarization smoothing for DOA estimation with coprime vector sensor arrays | 2024-09-30 | Paper |
| Mixed near-field and far-field localization and array calibration with partly calibrated arrays | 2024-09-12 | Paper |
| Joint Range and Velocity Estimation With Intrapulse and Intersubcarrier Doppler Effects for OFDM-Based RadCom Systems | 2022-09-23 | Paper |
| On Decoding Binary Quasi-Reversible BCH Codes | 2022-07-13 | Paper |
| On Decoding Algebraic Codes Using Radical Locators | 2020-12-04 | Paper |
| Reconstruction of Single Image from Multiple Blurry Measured Images | 2019-02-06 | Paper |
| The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance | 2018-09-19 | Paper |
| Using the Difference of Syndromes to Decode Quadratic Residue Codes | 2018-09-19 | Paper |
| Robust sparse signal reconstructions against basis mismatch and their applications | 2018-05-17 | Paper |
| Novel Approaches to the Parametric Cubic-Spline Interpolation | 2017-10-27 | Paper |
| Algebraic Decoding of Some Quadratic Residue Codes With Weak Locators | 2017-04-28 | Paper |
| Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory | 2014-03-17 | Paper |
| Decoding of the \((24,12,8)\) extended Golay code up to four errors | 2013-10-18 | Paper |
| Fast algorithm for decoding of systematic quadratic residue codes | 2013-10-18 | Paper |
| Soft decoding of the \((23,12,7)\) Golay-code up to five errors | 2013-10-18 | Paper |
| Algebraic decoding of the \((73,37,13)\) quadratic residue code | 2013-10-18 | Paper |
| A cyclic weight algorithm of decoding the \((47, 24, 11)\) quadratic residue code | 2012-10-02 | Paper |
| On the decoding of the \((24, 12, 8)\) Golay code | 2011-01-28 | Paper |
| High speed decoding of the binary \((47, 24, 11)\) quadratic residue code | 2010-09-15 | Paper |
| Algebraic decoding of the \((41, 21, 9)\) quadratic residue code | 2009-10-01 | Paper |
| A lookup table decoding of systematic \((47, 24, 11)\) quadratic residue code | 2009-07-22 | Paper |
| Algebraic Decoding of the $(89, 45, 17)$ Quadratic Residue Code | 2009-02-24 | Paper |
| The Weight Distributions of Some Binary Quadratic Residue Codes | 2008-12-21 | Paper |
| A result on the weight distributions of binary quadratic residue codes | 2007-09-20 | 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 |
| The advanced OCA for 2-D discrete periodized wavelet transformation | 2001-12-02 | Paper |
| On decoding of both errors and erasures of a Reed-Solomon code using an inverse-free Berlekamp-Massey algorithm | 2001-09-04 | Paper |
| Inversionless decoding of both errors and erasures of Reed-Solomon code | 2001-08-14 | 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 |
| 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 |
| A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes | 1994-10-04 | 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 |
| 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 |
| 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 |
| 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 |
| 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 |
