Binary sequences of period \(2^m-1\) with large linear complexity

DOI10.1006/INCO.1998.2765zbMath1006.11073OpenAlexW1986260581MaRDI QIDQ1854281

Tor Helleseth, Halvard Martinsen

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2765

zbMATH Keywords

Galois ringsbase-2 expansion of trace sequences

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) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

The second coordinate sequence of a linear recurrence of maximal period over a nontrivial Galois ring of odd characteristic ⋮ Hижние оценки рангов координатных последовательностей линейных рекуррент максимального периода над собственным кольцом Галуа

Cites Work

• Unnamed Item
• Unnamed Item
• Binary sequences derived from ML-sequences over rings. I: Periods and minimal polynomials
• An expansion for the coordinates of the trace function over Galois rings
• A solution of the Harer-Zagier equation
• Twistor spaces and harmonic maps
• Binary sequences with Gold-like correlation but larger linear span
• An upper bound for Weil exponential sums over Galois rings and applications

This page was built for publication: Binary sequences of period \(2^m-1\) with large linear complexity