scientific article; zbMATH DE number 4023423
From MaRDI portal
Publication:3765876
Recommendations
Cited in
(only showing first 100 items - show all)- Completely \(Q\)-additive functions along irreducible polynomials with coefficients in a finite field
- Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
- Exotic Steiner chains in Miquelian Möbius planes of odd order
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Random sets which invariably generate the symmetric group
- Linear recurrences over a finite field with exactly two periods
- Computational problems in the theory of finite fields
- The covering radius of \(\mathrm{PGL}(3, q)\)
- Computing Zeta Functions of Artin–schreier Curves over Finite Fields
- Global solution for a one-dimensional model problem in thermally radiative magnetohydrodynamics
- On theorems of Carlitz and Payne on permutation polynomials over finite fields with an application to \(x^{-1}+L(x)\)
- Zeros of Diagonal Equations over Finite Fields
- Permutation group approach to association schemes
- The limitations of nice mutually unbiased bases
- Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)
- New classes of perfect maps. I
- Point sets and sequences with small discrepancy
- New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent
- A note on discrete logarithms in finite fields
- Norm-graphs and bipartite Turán numbers
- The \(t\)-wise independence of substitution-permutation networks
- On the enumeration and classification of \(\sigma\)-LCD codes over finite commutative chain rings
- A simple computational model for acceptance/rejection of binary sequence generators
- Construction of orthomorphic MDS matrices with primitive characteristic polynomial
- Some important results on \(\mathcal{T}\)-direct codes
- Programmable cellular automata based Montgomery hardware architecture
- Synthesis of cryptographic interleaved sequences by means of linear cellular automata
- On the equations of thermally radiative magnetohydrodynamics
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
- Frequent directions: simple and deterministic matrix sketching
- Sets with even partition functions and cyclotomic numbers
- Whirlwind: a new cryptographic hash function
- Free storage basis conversion over finite fields
- Error correcting sequence and projective de Bruijn graph
- An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field
- On codes from norm-trace curves
- Univariate polynomial factorization over finite fields
- A concrete matrix field description of some Galois fields.
- MacWilliams identities of the linear codes over \(\mathbb{F}_q\times (\mathbb{F}_q+v \mathbb{F}_q)\)
- On the first fall degree of summation polynomials
- The Distribution of Reciprocal Pairs Modulo Polynomials over a Finite Field
- An efficient algorithm to generate binary sequences for cryptographic purposes
- Discrete phase-space structure of \(n\)-qubit mutually unbiased bases
- Properties of a family of cryptographic Boolean functions
- Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
- Mixer–a new stream cipher
- On the number of Frobenius-trivial vector bundles on specific curves
- Multi-twisted additive self-orthogonal and ACD codes are asymptotically good
- Weight enumerators of all cubic-primitive irreducible cyclic codes of odd prime power length
- Linear recurring sequences over rings and modules
- Classification of finite fields with applications
- Complexity of a determinate algorithm for the discrete logarithm
- DISCRETE COHERENT STATES FOR n QUBITS
- Weighted Reed-Muller codes revisited
- Generalized residue and t-residue codes and their idempotent generators
- From additive flowers to additive automata networks
- Trace-orthogonal normal bases
- Finite fields: theory and applications
- Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
- On linearised polynomials, Sidon arrays and fast construction of Sidon sets
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- Linear recurring sequences for computing the resultant of multivariate polynomials
- Discrete linear models for the generalized self-shrunken sequences
- Equiangular tight frames from Paley tournaments
- Mathematical theory of compressible, viscous, and heat conducting fluids
- PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
- The average density of \(k\)-normal elements over finite fields
- On the atomicity of monoid algebras
- On the dimension of permutation vector spaces
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- Symmetric Bush-type generalized Hadamard matrices and association schemes
- A coding scheme that increases the code rate
- Bi-orthogonal mutually unbiased bases for N-qubit systems
- On random polynomials over finite fields
- Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
- A necessary and sufficient condition for an algebraic integer to be a Salem number
- Nielsen equivalence of generating pairs of \(\mathrm{SL}(2,q)\).
- On multivariate polynomials with many roots over a finite grid
- On codes over \(\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\)
- Covering arrays of strength three from extended permutation vectors
- On the polynomial basis of \(\mathrm{GF}(2^n)\) having a small number of trace-one elements
- Using Normal Bases for Compact Hardware Implementations of the AES S-Box
- Matroidal structure of skew polynomial rings with application to network coding
- Cubic fields: a primer
- Lower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers
- A fast algorithm to compute irreducible and primitive polynomials in finite fields
- Limit Theorems for Combinatorial Structures via Discrete Process Approximations
- A construction of primitive polynomials over finite fields
- The automorphism group of projective norm graphs
- New criteria for linear maps in AES-like ciphers
- Patterns and periodicity in a family of resultants
- Weight of irreducible polynomials with coefficients in a finite field
- Multi-sequences with \(d\)-perfect property
- Elliptic curve cryptography arithmetic in terms of one variable polynomial division
- Strategic attack on the shrinking generator
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Modelling the shrinking generator in terms of linear CA
- Trace of products in finite fields from a combinatorial point of view
- Further results on permutation polynomials over finite fields
- The Serial Test for Congruential Pseudorandom Numbers Generated by Inversions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765876)
