Release time:2025-03-31

Hits:

DOI number:10.1587/transfun.E98.A.246

Journal:IEICE TRANSACTIONS on Fundamentals

Key Words:linear recurring sequence;primitive sequence;residue ring;character sum

Abstract:Primitive linear recurring sequences over rings are important in modern communication technology, and character sums of such sequences are used to analyze their statistical properties. We obtain a new upper bound for the character sum of primitive sequences of order n over the residue ring modulo a square-free odd integer m, and thereby improve previously known bound m^(n/2).

Co-author:Yu ZHOU, Ying GAO

First Author:Lin WANG

Indexed by:Journal paper

Volume:E98-A

Issue:1

Page Number:246-249

ISSN No.:1745-1337

Translation or Not:no

Date of Publication:2015-01-01