Automatic complexity of shift register sequences

DOI10.1016/J.DISC.2018.05.015zbMath1422.94024arXiv1607.08226OpenAlexW2806486110WikidataQ129718420 ScholiaQ129718420MaRDI QIDQ724846

Bjørn Kjos-Hanssen

Publication date: 26 July 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

finite automatalinear feedback shift registersautomatic complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (1)

Automatic complexity of Fibonacci and tribonacci words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nondeterministic automatic complexity of overlap-free and almost square-free words
• Shift-register synthesis and BCH decoding
• Coding and Cryptography

This page was built for publication: Automatic complexity of shift register sequences