Pages that link to "Item:Q162945"
From MaRDI portal
The following pages link to Applicable Algebra in Engineering, Communication and Computing (Q162945):
Displaying 50 items.
- Several classes of polynomials with low differential uniformity over finite fields of odd characteristic (Q260084) (← links)
- On the complexity of skew arithmetic (Q260085) (← links)
- One weight \(\mathbb {Z}_2\mathbb {Z}_4\) additive codes (Q260086) (← links)
- Trellis complexity and pseudoredundancy of relative two-weight codes (Q260089) (← links)
- Eisenstein polynomials over function fields (Q260092) (← links)
- Bracelet monoids and numerical semigroups (Q300874) (← links)
- Euclidean self-dual codes over non-commutative Frobenius rings (Q300875) (← links)
- Further refinements of Miller's algorithm on Edwards curves (Q300877) (← links)
- Multibase scalar multiplications in cryptographic pairings (Q300879) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Cyclic codes over \(\mathbb{F}_{2^m}[u]/\langle u^k\rangle \) of oddly even length (Q315737) (← links)
- Concatenated structure of cyclic codes over \(\mathbb {Z}_4\) of length \(4n\) (Q315738) (← links)
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740) (← links)
- On the number of Eisenstein polynomials of bounded height (Q360188) (← links)
- Minimum distance of some evaluation codes (Q360191) (← links)
- Improved algorithm for the isogeny problem for ordinary elliptic curves (Q360194) (← links)
- Constructing the set of complete intersection numerical semigroups with a given Frobenius number. (Q360195) (← links)
- Foreword to the special issue: Computer algebra in coding theory and cryptography (Q371233) (← links)
- On transitive parallelisms of \(\mathrm{PG}(3,4)\) (Q371236) (← links)
- Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\) (Q371238) (← links)
- Classification of the odd sets in \(\mathrm{PG}(4,4)\) and its application to coding theory (Q371240) (← links)
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- On the automorphism group of a binary self-dual \([120, 60, 24]\) code (Q371242) (← links)
- Optimal subcodes of formally self-dual codes and their optimum distance profiles (Q371244) (← links)
- Permutation decoding of codes from generalized Paley graphs (Q371247) (← links)
- List decoding of repeated codes (Q371249) (← links)
- A multivariate based threshold ring signature scheme (Q371251) (← links)
- E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation (Q371254) (← links)
- Special issue: Selected papers based on the presentations at the first two meetings of the Michigan computational algebraic geometry group, MCAG 2012, Rochester, NY, USA and MCAG 2013, Kalamazoo, MI, USA (Q377669) (← links)
- Some new binary quasi-cyclic codes from codes over the ring \(\mathbb F_2 + u\mathbb F_2 + v\mathbb F_2 + uv\mathbb F_2\) (Q386409) (← links)
- Computational aspects of gonal maps and radical parametrization of curves (Q386411) (← links)
- Bielliptic curves of genus 3 in the hyperelliptic moduli (Q386413) (← links)
- On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve (Q386414) (← links)
- Structure of codes over the ring \(Z_3[v]/\langle v^3 - v\rangle\) (Q386415) (← links)
- The generalized road coloring problem and periodic digraphs (Q429736) (← links)
- On the location of roots of non-reciprocal integer polynomials (Q429737) (← links)
- The lower bound on the second-order nonlinearity of a class of Boolean functions with high nonlinearity (Q429740) (← links)
- On necessary and sufficient conditions for differential flatness (Q429742) (← links)
- On the equivalence of linear codes (Q429744) (← links)
- A check digit system for hexadecimal numbers (Q429745) (← links)
- Elliptic curves and Fibonacci numbers arising from Lindenmayer system with symbolic computation (Q429747) (← links)
- Higher weights for codes over rings (Q429748) (← links)
- On the arithmetic of the endomorphisms ring \(\text{End}(\mathbb Z_p\times\mathbb Z_{p^2})\). (Q429750) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Counting decomposable multivariate polynomials (Q429753) (← links)
- Generalized quasi-cyclic codes over Galois rings: structural properties and enumeration (Q429754) (← links)
- Testing degenerate polynomials (Q429757) (← links)
- Envelope computation in the plane by approximate implicitization (Q429759) (← links)
- The minimum distance of parameterized codes on projective tori (Q429761) (← links)
- Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
