Papers
Topics
Authors
Recent
Search
2000 character limit reached

The linear complexity of new binary cyclotomic sequences of period $p^n$

Published 11 Dec 2017 in math.NT and cs.CR | (1712.03947v1)

Abstract: In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear complexity of these sequences.

Citations (7)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Vladimir Edemskiy 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up