On the Expansion Complexity of Sequences Over Finite Fields

DOI10.1109/TIT.2018.2792490zbMath1395.94262arXiv1702.05329MaRDI QIDQ5375572

Harald Niederreiter, Domingo Gómez-Pérez, László Mérai

Publication date: 14 September 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.05329

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)

Related Items (3)

Pseudorandom sequences derived from automatic sequences ⋮ Algebraic dependence in generating functions and expansion complexity ⋮ Perfect linear complexity profile and apwenian sequences

This page was built for publication: On the Expansion Complexity of Sequences Over Finite Fields