Bit-serial Reed - Solomon encoders

Cited in

(25)

Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\)
Self-dual bases in \(\mathbb{F}_{q^ n}\)
Two new decoding algorithms for Reed-Solomon codes
Improved identification schemes based on error-correcting codes
Algorithms for exponentiation in finite fields
Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field
On the self-dual normal bases and their distribution
On the construction of irreducible self-reciprocal polynomials over finite fields
Finite field arithmetic using quasi-normal bases
Composed products and factors of cyclotomic polynomials over finite fields
Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
A new characterization of dual bases in finite fields and its applications
A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)
A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
A Decoding Approach to Reed–Solomon Codes from Their Definition
Fast message authentication using efficient polynomial evaluation
Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\)
Some subgroups of \(\mathbb{F}_q^*\) and explicit factors of \(x^{2^nd}-1\in \mathbb{F}_q[x]\)
scientific article; zbMATH DE number 7123490 (Why is no real title available?)
On coefficients of polynomials over finite fields
On explicit factors of cyclotomic polynomials over finite fields
The 3-sparsity of X^n-1 over finite fields of characteristic 2
Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)
Low complexity normal bases

This page was built for publication: Bit-serial Reed - Solomon encoders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3955273)