scientific article; zbMATH DE number 204179

Publication date: 16 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

bibliography characters finite fields normal bases discrete Fourier transform Jacobi logarithm linear complexity irreducible polynomials discrete logarithm primitive polynomials Gaussian sums cyclic difference sets linear feedback shift-register sequences optimal normal bases Zech logarithm self- dual bases

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Polynomials over finite fields (11T06) Other character sums and Gauss sums (11T24) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Finite fields and commutative rings (number-theoretic aspects) (11Txx)

Related Items (75)

Character sums, primitive elements, and powers in finite fields ⋮ Trace representation and linear complexity of binary sequences derived from Fermat quotients ⋮ Generation of bases with definite factorization for ann-qubit system and mutually unbiased sets construction ⋮ On \(k\)-normal elements over finite fields ⋮ Almost weakly self-dual bases for finite fields ⋮ Computing the reciprocal of units in Galois rings ⋮ On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime ⋮ Weights modulo \(p^e\) of linear codes over rings ⋮ Computing special powers in finite fields ⋮ The cross number of finite Abelian groups. III ⋮ Fast arithmetic with general Gauß periods ⋮ Generalizations of self-reciprocal polynomials ⋮ A new shortening method and Hermitian self-dual codes over \(\mathbb{F}_2 + v \mathbb{F}_2\) ⋮ The expected value of the joint linear complexity of periodic multisequences ⋮ Quadratic functions with prescribed spectra ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ Enumeration of orbits on cycles for linear and affine groups ⋮ Irreducible polynomials over \(\mathrm{GF}(2)\) with three prescribed coefficients. ⋮ Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences ⋮ Some relations between the irreducible polynomials over a finite field and its quadratic extension ⋮ Correlation of the two-prime Sidel'nikov sequence ⋮ Low complexity normal bases in \(\mathbb F_{2^n}\) ⋮ Type II codes over \(\mathbb{F}_{2^m} + u\mathbb{F}_{2^m}\) ⋮ Existence and properties of \(k\)-normal elements over finite fields ⋮ Minimum Lee weights of type II codes over \(\mathbb F_{2^r}\) ⋮ Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields ⋮ Gauss periods as constructions of low complexity normal bases ⋮ On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals ⋮ Pseudorandom vector sequences of maximal period generated by triangular polynomial dynamical systems ⋮ Upper bounds and constructions of complete asynchronous channel hopping systems ⋮ Autocorrelation values of quaternary cyclotomic sequence of length 2pm ⋮ Fast message authentication using efficient polynomial evaluation ⋮ Gauss periods: orders and cryptographical applications ⋮ On generating invertible circulant binary matrices with a prescribed number of ones ⋮ Asynchronous channel hopping systems from difference sets ⋮ Expansion complexity and linear complexity of sequences over finite fields ⋮ Automorphisms of hyperelliptic GAG-codes ⋮ Automorphisms of hyperelliptic GAG-codes ⋮ A method for constructing a self-dual normal basis in odd characteristic extension fields ⋮ Primitive elements with zero traces ⋮ Abelian groups, Gauss periods, and normal bases ⋮ On the complexity of the normal bases via prime Gauss period over finite fields ⋮ On the linear complexity of Legendre-Sidelnikov sequences ⋮ Cyclotomic \(\mathcal R\)-orthomorphisms of finite fields ⋮ Primitive Normal Polynomials Over Finite Fields ⋮ On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences ⋮ Results on the Crosscorrelation and Autocorrelation of Sequences ⋮ Continued fraction for formal Laurent series and the lattice structure of sequences ⋮ Hamming correlation of higher order ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ The construction of regular Hadamard matrices by cyclotomic classes ⋮ The trace of an optimal normal element and low complexity normal bases ⋮ Remarks on a cyclotomic sequence ⋮ On the existence of abelian Hadamard difference sets and a new family of difference sets ⋮ Squarefree polynomials over finite fields and regular semisimple classes of certain classical groups ⋮ An explicit similarity transform between cellular automata and LFSR matrices ⋮ A combinatorial construction of the Gray map over Galois rings ⋮ Construction of self-dual normal bases and their complexity ⋮ On the linear complexity profile of some new explicit inversive pseudorandom numbers ⋮ Complexities of self-dual normal bases ⋮ Product of symplectic groups and its cyclic orbit code ⋮ Enumeration of special sets of polynomials over finite fields ⋮ Algorithms for exponentiation in finite fields ⋮ Counting functions and expected values for the lattice profile at \(n\) ⋮ A note on orthogonal circulant matrices over finite fields ⋮ An existence theorem for cyclic triplewhist tournaments ⋮ Decompositions of difference sets ⋮ On the linear complexity profile of explicit nonlinear pseudorandom numbers. ⋮ Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform ⋮ On atomic density of numerical semigroup algebras ⋮ Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration ⋮ The number of rational points of a class of Artin-Schreier curves. ⋮ On completely free elements in finite fields ⋮ An explicit description of the set of all normal bases generators of a finite field ⋮ Perfect codes and balanced generalized weighing matrices. II

This page was built for publication: