The following pages link to Algebraic coding theory (Q2762882):
Displaying 50 items.
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- \(\sigma\)-Automata and Chebyshev-polynomials (Q1978501) (← links)
- New results on quasi-subfield polynomials (Q1979951) (← links)
- The ideal entropy of BCI-algebras and its application in the binary linear codes (Q2001115) (← links)
- Linear feedback shift registers and the minimal realization problem (Q2002558) (← links)
- Expansive automata networks (Q2003992) (← links)
- Optimal parameters for the WG stream cipher family (Q2016392) (← links)
- On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials (Q2031633) (← links)
- Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial (Q2043988) (← links)
- Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2 (Q2056728) (← links)
- Walsh transforms of trace forms with three or more terms and some maximal Artin-Schreier curves (Q2075015) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- Some enumeration results on trace forms of low radical over finite fields of characteristic two (Q2123299) (← links)
- RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) (Q2140794) (← links)
- A generalization of multi-twisted codes over finite fields, their Galois duals and type II codes (Q2142527) (← links)
- Multi-twisted additive codes over finite fields (Q2143382) (← links)
- A class of constacyclic codes over \({\mathbb{F}}_{p^m}[u]/\langle u^2\rangle\) (Q2147530) (← links)
- On \(\sigma \)-self-orthogonal constacyclic codes over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) (Q2158242) (← links)
- Properties of constacyclic codes under the Schur product (Q2182071) (← links)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
- Kötter interpolation in skew polynomial rings (Q2249788) (← links)
- On self-dual constacyclic codes over finite fields (Q2256100) (← links)
- Fault tolerance in distributed systems using fused state machines (Q2256949) (← links)
- Difference equations with delay (Q2258375) (← links)
- Solution of linear equations with Hankel and Toeplitz matrices (Q2264401) (← links)
- Algebraic codes for network coding (Q2269364) (← links)
- Repeated-root constacyclic codes of length \(k\ell p^s\) (Q2305667) (← links)
- Semidefinite programming bounds for Lee codes (Q2312798) (← links)
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes (Q2324762) (← links)
- Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight (Q2325304) (← links)
- Skew multi-twisted codes over finite fields and their Galois duals (Q2326699) (← links)
- Factorization of composed polynomials and applications (Q2329189) (← links)
- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\) (Q2329194) (← links)
- Generalized residue and t-residue codes and their idempotent generators (Q2340179) (← links)
- Families of \(p\)-ary sequences with low correlation and large linear complexity (Q2341595) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Further improvements on asymptotic bounds for codes using distinguished divisors (Q2370632) (← links)
- Some new results on the conjecture on exceptional APN functions and absolutely irreducible polynomials: the Gold case (Q2397504) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields (Q2408286) (← links)
- A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity (Q2416414) (← links)
- Primitive idempotent tables of cyclic and constacyclic codes (Q2416930) (← links)
- Factorization of a class of composed polynomials (Q2420476) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- Evaluation codes defined by finite families of plane valuations at infinity (Q2436567) (← links)
- Fast skew-feedback shift-register synthesis (Q2436582) (← links)
- Optimal control for non-polynomial systems (Q2436813) (← links)
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability (Q2448071) (← links)
- Highly degenerate quadratic forms over \(\mathbb F_{2}\) (Q2467313) (← links)
- Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials (Q2473633) (← links)
