The complexity of a periodic sequence over GF(p)

DOI10.1016/0166-218X(88)90035-2zbMath0661.94013OpenAlexW2084403745MaRDI QIDQ1113874

Shenquan Xie

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90035-2

zbMATH Keywords

feedback shift registerperiodic sequence

Mathematics Subject Classification ID

Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of a periodic sequence over GF(p)