The following pages link to (Q3699606):
Displaying 40 items.
- The eigenstructure of finite field trigonometric transforms (Q551319) (← links)
- An algorithm for ``Ulam's Game'' and its application to error correcting codes (Q671940) (← links)
- The decoding of extended Reed-Solomon codes (Q803107) (← links)
- Aggregate error locator and error value computation in AG codes (Q855879) (← links)
- Factorization of symmetric circulant matrices in finite fields (Q921087) (← links)
- Visualizing Vandermonde's determinant through nonintersecting lattice paths (Q972840) (← links)
- On the abundance of traveling waves in 1D infinite cellular automata (Q992264) (← links)
- A trace representation of binary Jacobi sequences (Q1024461) (← links)
- Special algorithms for convolutions over Galois fields (Q1071810) (← links)
- The automorphism groups of Reed-Solomon codes (Q1090659) (← links)
- Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6 (Q1180155) (← links)
- Combination of decoding of error-correcting codes and equalization for channels with intersymbol interference (Q1180159) (← links)
- The Lanczos algorithm and Hankel matrix factorization (Q1194514) (← links)
- A note on binary cyclic codes of blocklength 63 (Q1199578) (← links)
- Fire codes revisited (Q1199640) (← links)
- On the weight enumerator of product codes (Q1199642) (← links)
- Codes for detecting and correcting propagation errors (Q1205910) (← links)
- Minimal eigenvalue of a real symmetric positive definite Toeplitz matrix (Q1339763) (← links)
- On the Delsarte inequalities (Q1375529) (← links)
- An algorithm for constructing a minimal partial realization in the multivariable case (Q1391043) (← links)
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform (Q1599195) (← links)
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes (Q1743273) (← links)
- On the linear complexity profile of some new explicit inversive pseudorandom numbers (Q1827574) (← links)
- The BCH-Goppa decoding as a moment problem and a tau function over finite fields. (Q1968040) (← links)
- Threshold data structures and coding theory (Q1978695) (← links)
- On the (im)possibility of non-interactive correlation distillation (Q2381528) (← links)
- Experimental realization of a highly secure chaos communication under strong channel noise (Q2425739) (← links)
- An error-correcting code framework for genetic sequence analysis (Q2492546) (← links)
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
- Advances in the performance of Reed-Solomon codes (Q2732700) (← links)
- Fast tabular decoding method for multi-delimiter codes (Q2819050) (← links)
- A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
- (Q3491473) (← links)
- A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm (Q3546866) (← links)
- Brownian matrices: properties and extensions (Q3734970) (← links)
- Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders (Q4552984) (← links)
- A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes (Q5088387) (← links)
- Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols (Q5125926) (← links)
- Fast Essentially Maximum Likelihood Decoding of the Golden Code (Q5273611) (← links)
- Simple Codes and Sparse Recovery with Fast Decoding (Q6101016) (← links)
