The following pages link to Algebraic coding theory (Q2762882):
Displaying 50 items.
- The generalized Goertzel algorithm and its parallel hardware implementation (Q2481284) (← links)
- Extremal problems among subsets of a set. (Reprint) (Q2497992) (← links)
- The Berlekamp-Massey algorithm revisited (Q2502174) (← links)
- Trace forms over finite fields of characteristic 2 with prescribed invariants (Q2517816) (← links)
- Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y]\) (Q2519287) (← links)
- On the Golay perfect binary code (Q2532761) (← links)
- On the Mathieu groups \(M_ 22, M_ 23, M_ 24\) and the uniqueness of the assoiated Steiner system (Q2547267) (← links)
- Euler products, cyclotomy, and coding (Q2551784) (← links)
- Good self dual codes exist (Q2556303) (← links)
- On a family of pseudorandom binary sequences (Q2567413) (← links)
- On the evaluation codes given by simple \(\delta \)-sequences (Q2634585) (← links)
- Computing the structure of finite algebras (Q2640676) (← links)
- Some negacyclic BCH codes and quantum codes (Q2677619) (← links)
- A family of Hermitian dual-containing constacyclic codes and related quantum codes (Q2690259) (← links)
- On the cogirth of binary matroids (Q2701021) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- \((d, \boldsymbol{\sigma})\)-Veronese variety and some applications (Q2701497) (← links)
- Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
- Unconventional construction of DNA codes: Group Homomorphism (Q2831828) (← links)
- Extended Varshamov-Gilbert-Sacks bound for linear Lee weight codes (Q2876716) (← links)
- The Performance of Concatenated Schemes Based on Non-binary Multithreshold Decoders (Q2950426) (← links)
- Some Applications of the Fourier Transform in Algebraic Coding Theory (Q2977865) (← links)
- (Q3102228) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- (Q3305164) (← links)
- Computing Logarithms in Finite Fields of Characteristic Two (Q3320493) (← links)
- IRREGULARLY DECIMATED CHAOTIC MAP(S) FOR BINARY DIGITS GENERATIONS (Q3394414) (← links)
- A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
- Linear Complexity of Periodic Sequences: A General Theory (Q3452366) (← links)
- Factorisation sur $\mathbb {Z}[X]$ des polynômes de degré élevé à l’aide d’un monomorphisme (Q3483364) (← links)
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators (Q3600338) (← links)
- Serial concatenation of Hermitian codes with ring-TCM codes (Q3651641) (← links)
- (Q3668558) (← links)
- THE LEE-SCHEME AND BOUNDS FOR LEE-CODES (Q3671042) (← links)
- (Q3692857) (← links)
- A Method to Compute Minimal Polynomials (Q3735078) (← links)
- An improvement to the Minkowski‐Hiawka bound for packing superballs (Q3744239) (← links)
- A new random number generator from permutation groups (Q3757238) (← links)
- Poids et équivalence des codes linéaires (Q3777943) (← links)
- (Q3783615) (← links)
- Factoring with Cyclotomic Polynomials (Q3809851) (← links)
- On counting absolute trace of powers inGF(p m ) (Q3809898) (← links)
- (Q3824493) (← links)
- Inverse scattering and minimal partial realizations (Q3833948) (← links)
- Indecomposable local maps of tessellation automata (Q3856103) (← links)
- (Q3859255) (← links)
- (Q3882549) (← links)
- On Polynomial Factorization Over Finite Fields (Q3924300) (← links)
- Obtaining Specified Irreducible Polynomials over Finite Fields (Q3963112) (← links)
