scientific article; zbMATH DE number 4023423
From MaRDI portal
Publication:3765876
Recommendations
Cited in
(only showing first 100 items - show all)- Discrete phase-space structure of \(n\)-qubit mutually unbiased bases
- Error correcting sequence and projective de Bruijn graph
- Cryptanalysis of an E0-like combiner with memory
- New criteria for linear maps in AES-like ciphers
- Patterns and periodicity in a family of resultants
- Permutation group approach to association schemes
- Remarks on nonlinear congruential pseudorandom numbers
- Univariate polynomial factorization over finite fields
- Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
- Recent trends in random number and random vector generation
- Computational problems in the theory of finite fields
- The smallest matrix of given period and primitive roots of unity
- On a convolution of linear recurring sequences over finite fields
- A note on discrete logarithms in finite fields
- Random sets which invariably generate the symmetric group
- Binary periodic synchronizing sequences
- On primitive and free roots in a finite field
- The soluble subgroups and the Tits alternative in linear groups over rings of fractions of polycyclic group rings. I
- A remark on the minimal polynomial of the product of linear recurring sequences
- Shifts on the hyperfinite \(II_1\) factor
- An explicit similarity transform between cellular automata and LFSR matrices
- Finite extensions of free pro-\(p\) groups of rank at most two
- Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- Self-dual bases in \(\mathbb{F}_{q^ n}\)
- Trace-orthogonal normal bases
- Linear recurring sequences for computing the resultant of multivariate polynomials
- The complexity of sparse polynomial interpolation over finite fields
- Multiplicative and additive recurrent sequences
- Perfect factors in the de Bruijn graph
- The combinatorics of discrete self-similarity
- Additive cellular automata and global injectivity
- On codes from norm-trace curves
- Uniform distribution of linear recurring sequences modulo prime powers.
- Counting functions and expected values for the \(k\)-error linear complexity
- \#P-completeness of counting roots of a sparse polynomial
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)
- The action of \(\mathrm{GL}_2(\mathbb{F}_q)\) on irreducible polynomials over \(\mathbb{F}_q\), revisited
- Nilpotent linearized polynomials over finite fields and applications
- The covering radius of \(\mathrm{PGL}(3, q)\)
- On the number of Frobenius-trivial vector bundles on specific curves
- Multi-sequences with \(d\)-perfect property
- Finite fields: theory and applications
- A simple linearization of the self-shrinking generator by means of cellular automata
- An anisotropic elastoplastic constitutive formulation generalised for orthotropic materials
- 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
- A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms
- Uniform random number generation
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- A note on orthogonal circulant matrices over finite fields
- Faster fractal pictures by finite fields and far rings
- Riffle shuffles, cycles, and descents
- Generalized Fermat, double Fermat and Newton sequences.
- How many vectors generate maximal cyclic subspaces?
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Complexity of a determinate algorithm for the discrete logarithm
- Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)
- New classes of perfect maps. I
- The combinatorial power of the companion matrix
- Linear recurring sequences over modules
- Linear recurring sequences over rings and modules
- Weighted Reed-Muller codes revisited
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Some congruences of Kloosterman sums and their characteristic polynomials
- Constructing efficient linear local features in image processing and analysis problems
- The dynamics of permutations on irreducible polynomials
- Counting solutions of special linear equations over finite fields
- Cubic fields: a primer
- A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
- Companion matrices and golden-Fibonacci sequences
- On the first fall degree of summation polynomials
- Linear recurrences over a finite field with exactly two periods
- Exotic Steiner chains in Miquelian Möbius planes of odd order
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- Dynamical irreducibility of polynomials modulo primes
- Cyclic generators for saturated orthogonal arrays
- From additive flowers to additive automata networks
- Explicit values of the DDT, the BCT, the FBCT, and the FBDT of the inverse, the Gold, and the Bracken-Leander S-boxes
- A note on units in \(\mathbb{F}_Q \operatorname{SL} (2, \mathbb{Z}_3)\)
- Multiple-rate error-correcting coding scheme
- Exponential sums in prime fields for modular forms
- Polycyclic codes associated with trinomials: good codes and open questions
- The \(t\)-wise independence of substitution-permutation networks
- On the enumeration and classification of \(\sigma\)-LCD codes over finite commutative chain rings
- Normality of the Thue-Morse function for finite fields along polynomial values
- Weight of irreducible polynomials with coefficients in a finite field
- Congruences for the coefficients of the powers of the Euler product
- On the number of cyclic subgroups of prime order in the group of diagonal matrices over a cyclotomic field
- The estimated number of irreducible binomials
- A necessary and sufficient condition for an algebraic integer to be a Salem number
- Kötter interpolation in skew polynomial rings
- Further results on permutation polynomials over finite fields
- On theorems of Carlitz and Payne on permutation polynomials over finite fields with an application to \(x^{-1}+L(x)\)
- Jordan forms and \(n\)th order linear recurrences
- Properties of syndrome distribution for blind reconstruction of cyclic codes
- Existence results on \(k\)-normal elements over finite fields
- Classification of finite fields with applications
- On the atomicity of monoid algebras
- Factorization of composed polynomials and applications
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)
