Linear complexity of ternary sequences formed on the basis of power residue classes

DOI10.1134/S0032946008040017zbMath1173.94412OpenAlexW1970216360MaRDI QIDQ734266

Vladimir Edemskiy

Publication date: 20 October 2009

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946008040017

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)

Related Items (2)

Unnamed Item ⋮ About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)

Cites Work

• Linear Complexity over F p of Ternary Sidel’nikov Sequences
• Public-key cryptosystems based on cubic finite field extensions
• New self-dual codes over GF(4) with the highest known minimum weights
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear complexity of ternary sequences formed on the basis of power residue classes