The following pages link to (Q2762882):
Displaying 50 items.
- A note on the weight distribution of minimal constacyclic codes (Q262998) (← links)
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\) (Q285476) (← links)
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- On constacyclic codes over finite fields (Q301647) (← links)
- Linearized polynomial maps over finite fields (Q397866) (← links)
- Association schemes related to Delsarte-Goethals codes (Q478360) (← links)
- Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field (Q488282) (← links)
- FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) (Q488927) (← links)
- On sequences, rational functions and decomposition (Q499747) (← links)
- Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes (Q514545) (← links)
- Expansion complexity and linear complexity of sequences over finite fields (Q517722) (← links)
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (Q522204) (← links)
- On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\) (Q539903) (← links)
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions (Q661978) (← links)
- Practical constructive schemes for deterministic shared-memory access (Q675852) (← links)
- On the structure of order domains (Q700167) (← links)
- Weight distribution of translates of MDS codes (Q749509) (← links)
- Windmill polynomials over fields of characteristic two (Q753791) (← links)
- HELP: a sparse error locator polynomial for BCH codes (Q780362) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Power error locating pairs (Q782853) (← links)
- On the discriminant of a trinomial (Q800975) (← links)
- Displacement structure for Hankel, Vandermonde, and related (derived) matrices (Q803726) (← links)
- Recursive partial realization for 2-D data arrays (Q811470) (← links)
- The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization (Q820716) (← links)
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes (Q892297) (← links)
- Factoring polynomials modulo special primes (Q909466) (← links)
- An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs (Q912851) (← links)
- Construction of binary minimal product parity-check matrices (Q939176) (← links)
- Twisted tensor product codes (Q1009006) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← links)
- Composition of recursions and nonlinear complexity of periodic binary sequences (Q1009065) (← links)
- Invariants of trace forms over finite fields of characteristic 2 (Q1011455) (← links)
- Error correcting sequence and projective de Bruijn graph (Q1015424) (← links)
- Generalizing binary quadratic residue codes to higher power residues over larger fields (Q1017424) (← links)
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field (Q1026985) (← links)
- Factorization of determinants over finite fields and application in stream ciphers (Q1032496) (← links)
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\) (Q1046743) (← links)
- Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N (Q1059674) (← links)
- On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials (Q1071058) (← links)
- Coefficients of primitive polynomials (Q1076725) (← links)
- Periodicities of partition functions and Stirling numbers modulo \(p\) (Q1085193) (← links)
- A VLSI architecture for performing finite field arithmetic with reduced table lookup (Q1099611) (← links)
- 2-dimensional arithmetic residue check codes (Q1101065) (← links)
- A note on the computation of the bit error rate for binary block codes (Q1101413) (← links)
- Discriminants and the irreducibility of a class of polynomials in a finite field of arbitrary characteristic (Q1103005) (← links)
- A t-unidirectional error-detecting systematic code (Q1113877) (← links)
- On the number of controllable linear systems over a finite field (Q1124570) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Blockwise Lee error-correcting codes (Q1141119) (← links)
