On the complexity of a family of Legendre sequences with irreducible polynomials
type: Item
instance of: scholarly article
title: On the complexity of a family of Legendre sequences with irreducible polynomials
zbMATH Open document ID: 1370.11095
author: Katalin Gyarmati
published in: Finite Fields and their Applications
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 11K45
Mathematics Subject Classification ID: 12E05
zbMATH DE Number: 6756440
zbMATH Keywords: pseudorandom
zbMATH Keywords: \(f\)-complexity
zbMATH Keywords: irreducible polynomials
MaRDI profile type: Publication
full work available at URL: j.ffa.2014.11.004
OpenAlex ID: W2089462456
cites work: A complexity measure for families of binary sequences
cites work: Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
cites work: On the complexity of families of pseudo-random subsets
cites work: Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
cites work: Construction of large families of pseudorandom binary sequences
cites work: Concatenation of pseudorandom binary sequences
cites work: On the complexity of a family related to the Legendre symbol
cites work: Measures of pseudorandomness of families of binary lattices. II: A further construction
cites work: The cross-correlation measure for families of binary sequences
cites work: Q2708612
cites work: Family Complexity and VC-Dimension
cites work: On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
cites work: On pseudorandomness of families of binary sequences
cites work: Collision and avalanche effect in families of pseudorandom binary sequences
cites work: Q5794285
cites work: Family complexity and cross-correlation measure for families of binary sequences
DOI: 10.1016/J.FFA.2014.11.004
description: scientific article; zbMATH DE number 6756440