Pages that link to "Item:Q3955273"

The following pages link to Bit-serial Reed - Solomon encoders (Q3955273):

Displaying 24 items.

• Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\) (Q499673) (← links)
• On coefficients of polynomials over finite fields (Q650833) (← links)
• On explicit factors of cyclotomic polynomials over finite fields (Q664390) (← links)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
• Low complexity normal bases (Q923627) (← links)
• Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\) (Q1199646) (← links)
• Self-dual bases in \(\mathbb{F}_{q^ n}\) (Q1309828) (← links)
• Two new decoding algorithms for Reed-Solomon codes (Q1311609) (← links)
• Improved identification schemes based on error-correcting codes (Q1352426) (← links)
• Algorithms for exponentiation in finite fields (Q1581128) (← links)
• Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
• Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field (Q2168939) (← links)
• On the self-dual normal bases and their distribution (Q2250766) (← links)
• On the construction of irreducible self-reciprocal polynomials over finite fields (Q2277017) (← links)
• Finite field arithmetic using quasi-normal bases (Q2370646) (← links)
• Composed products and factors of cyclotomic polynomials over finite fields (Q2391671) (← links)
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field (Q2447801) (← links)
• A new characterization of dual bases in finite fields and its applications (Q2457004) (← links)
• A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900) (← links)
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
• A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
• Fast message authentication using efficient polynomial evaluation (Q4639340) (← links)
• Some subgroups of $mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1inmathbb{F}_q[x]$ (Q4997209) (← links)
• (Q5240552) (← links)