First, we calculate the values of exponential sums of cyclotomic classes of orders 3 and 6 over an extension field of GF(3). Then, we give a formula to compute ...
Oct 22, 2024 · First, we calculate the values of exponential sums of cyclotomic classes of orders 3 and 6 over an extension field of GF(3). Then, we give a ...
Aug 3, 2014 · We study the dual linear code of points and generators on ... Linear complexity of cyclotomic sequences of order six and BCH codes over GF(3).
This letter contributes to the investigation of the linear complexity of generalized cyclotomic sequences with the period p m , which are contained by the ...
Missing: six | Show results with:six
On the Autocorrelation and the Linear Complexity of | Request PDF
www.researchgate.net › Home › Paper
Cryptographically strong sequences should have long periods, large linear complexity, low correlation, and balance properties. In this paper, we determine ...
In this paper, three cyclotomic sequences of order four are employed to construct a number of classes of cyclic codes over GF ( q ) with prime length. Under ...
Missing: six | Show results with:six
Aug 3, 2013 · The same problem restricted to the class of cyclic codes is easier, but I am not aware of an algorithmic ways of verifying the minimum distance.
Sep 25, 2015 · In this paper, we compute the autocorrelation values and linear complexity of the first class two-prime Whiteman's generalized cyclotomic ...
The linear complexity (or linear span), as a valuable measure of unpredictability, is precisely determined for DH-GCS8 in this paper. Our approach is based on ...
Let α be an element of GF(qm). • The minimal polynomial of α with respect to GF(q) is the smallest degree monic (non-zero) polynomial p(x) in GF(q)[x].
Missing: six | Show results with:six