The following pages link to (Q2949568):
Displaying 45 items.
- A new iterative computer search algorithm for good quasi-twisted codes (Q498982) (← links)
- On \(x^{q+1}+ax+b\) (Q596580) (← links)
- Some constacyclic self-dual codes over the integers modulo \(2^m\) (Q765799) (← links)
- Error probabilities for bounded distance decoding (Q851753) (← links)
- Frobenius-Artin algebras and infinite linear codes (Q888834) (← links)
- Fractal properties of the singular function \(s(u)\) (Q1182411) (← links)
- Self-dual bases in \(\mathbb{F}_{q^ n}\) (Q1309828) (← links)
- The MacWilliams theorem for two-dimensional modulo metrics (Q1352420) (← links)
- Unimodular arrays (Q1570096) (← links)
- On the minimum distance of negacyclic codes with two zeros (Q1633288) (← links)
- New linear codes from constacyclic codes (Q1659442) (← links)
- Random and conditional \((t,k)\)-diagnosis of hypercubes (Q1679217) (← links)
- Entanglement-assisted quantum MDS codes from negacyclic codes (Q1746915) (← links)
- On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes. (Q1763501) (← links)
- Skew constacyclic codes over finite fields and finite chain rings (Q1793100) (← links)
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions (Q1895965) (← links)
- Hermitian dual-containing narrow-sense constacyclic BCH codes and quantum codes (Q2105971) (← links)
- A note on systems of equations of power sums (Q2150618) (← links)
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem (Q2191201) (← links)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes (Q2207991) (← links)
- Lower bounds on the minimum distance of long codes in the Lee metric (Q2256106) (← links)
- Infinite families of MDR cyclic codes over \(\mathbb{Z}_4\) via constacyclic codes over \(\mathbb{Z}_4 [u] \slash \langle u^2 - 1 \rangle \) (Q2286618) (← links)
- New quadratic bent functions in polynomial forms with coefficients in extension fields (Q2321948) (← links)
- Nonbinary quantum convolutional codes derived from negacyclic codes (Q2348645) (← links)
- On codes over quaternion integers (Q2441443) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- New optimal asymmetric quantum codes derived from negacyclic codes (Q2443991) (← links)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions (Q2469466) (← links)
- Swan's theorem for binary tetranomials (Q2490142) (← links)
- Cyclic and some constacyclic codes over the ring \(\frac{\mathbb{Z}_4 [u]}{\langle u^2 - 1 \rangle}\) (Q2634388) (← links)
- Finding roots in with the successive resultants algorithm (Q2878836) (← links)
- Modified Alternating Step Generators with Non-Linear Scrambler (Q2960385) (← links)
- Wild McEliece Incognito (Q3102796) (← links)
- More on solving systems of power equations (Q3160741) (← links)
- How random is the characteristic polynomial of a random matrix ? (Q4287012) (← links)
- Factorization in <i>F<sub>q</sub></i>[<i>x</i>] and Brownian Motion (Q4289295) (← links)
- Construction of quantum negacyclic BCH codes (Q4620278) (← links)
- Cyclic and constacyclic codes over the ring Z4[u]/⟨u3 − u2⟩ and their Gray images (Q5100226) (← links)
- Deterministic root finding in finite fields (Q5270175) (← links)
- RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u] (Q5742999) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Subspace subcodes of generalized Reed-Solomon codes (Q5957984) (← links)
- A new algorithm for equivalence of cyclic codes and its applications (Q6115441) (← links)
- Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly} (Q6161965) (← links)
- Two families of entanglement-assisted quantum codes constructed from cyclic codes (Q6174273) (← links)
