Linear complexity problems of level sequences of Euler quotients and their related binary sequences
Linear complexity problems of level sequences of Euler quotients and their related binary sequences
About this item
Full title
Author / Creator
Publisher
Beijing: Science China Press
Journal title
Language
English
Formats
Publication information
Publisher
Beijing: Science China Press
Subjects
More information
Scope and Contents
Contents
The Euler quotient modulo an odd-prime power pr （r 〉 1） can be uniquely decomposed as a p-adic number of the form （u（p- 1）Pr- 1 _ 1）/pr ≡- ao （u） ＋ a1 （u）p ＋... ＋at- 1 （u）Pr- 1 （mod pr）, gcd（u, p） = 1, where 0 ≤ aj（u） 〈 p for 0 ≤ j≤r - 1 and we set all aj（u） = 0 if gcd（u,p） 〉 1. We firstly study certain arithmetic properties of the level sequences...
Alternative Titles
Full title
Linear complexity problems of level sequences of Euler quotients and their related binary sequences
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2918584169
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2918584169
Other Identifiers
ISSN
1674-733X
E-ISSN
1869-1919
DOI
10.1007/s11432-015-5305-y
