scientific article
From MaRDI portal
Publication:3699606
zbMath0577.94013MaRDI QIDQ3699606
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BCH codesfast Fourier transformBerlekamp-Massey algorithmnumber of multiplicationsWinogradfast convolution algorithmsnumber of additions
Related Items
Minimal eigenvalue of a real symmetric positive definite Toeplitz matrix ⋮ The automorphism groups of Reed-Solomon codes ⋮ On the (im)possibility of non-interactive correlation distillation ⋮ Aggregate error locator and error value computation in AG codes ⋮ Brownian matrices: properties and extensions ⋮ On the Delsarte inequalities ⋮ An algorithm for constructing a minimal partial realization in the multivariable case ⋮ Experimental realization of a highly secure chaos communication under strong channel noise ⋮ Factorization of symmetric circulant matrices in finite fields ⋮ The BCH-Goppa decoding as a moment problem and a tau function over finite fields. ⋮ Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6 ⋮ Combination of decoding of error-correcting codes and equalization for channels with intersymbol interference ⋮ Threshold data structures and coding theory ⋮ An algorithm for ``Ulam's Game and its application to error correcting codes ⋮ On syndrome decoding of punctured Reed-Solomon and Gabidulin codes ⋮ The Lanczos algorithm and Hankel matrix factorization ⋮ A note on binary cyclic codes of blocklength 63 ⋮ Fire codes revisited ⋮ On the weight enumerator of product codes ⋮ Codes for detecting and correcting propagation errors ⋮ Visualizing Vandermonde's determinant through nonintersecting lattice paths ⋮ The eigenstructure of finite field trigonometric transforms ⋮ An error-correcting code framework for genetic sequence analysis ⋮ On the abundance of traveling waves in 1D infinite cellular automata ⋮ A trace representation of binary Jacobi sequences ⋮ On the linear complexity profile of some new explicit inversive pseudorandom numbers ⋮ Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) ⋮ The decoding of extended Reed-Solomon codes ⋮ Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform ⋮ Special algorithms for convolutions over Galois fields
This page was built for publication:
