Bit-serial Reed - Solomon encoders
From MaRDI portal
Publication:3955273
DOI10.1109/TIT.1982.1056591zbMath0492.94016MaRDI QIDQ3955273
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Finite field arithmetic using quasi-normal bases, Improved identification schemes based on error-correcting codes, Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\), Composed products and factors of cyclotomic polynomials over finite fields, Some subgroups of $mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1inmathbb{F}_q[x$], Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field, A Decoding Approach to Reed–Solomon Codes from Their Definition, Unnamed Item, Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial, On coefficients of polynomials over finite fields, Low complexity normal bases, 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, On explicit factors of cyclotomic polynomials over finite fields, Fast message authentication using efficient polynomial evaluation, Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)], Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\), A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\), On the self-dual normal bases and their distribution, On the construction of irreducible self-reciprocal polynomials over finite fields, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, Algorithms for exponentiation in finite fields, Self-dual bases in \(\mathbb{F}_{q^ n}\), Two new decoding algorithms for Reed-Solomon codes
