A tighter bound for the character sum of primitive sequences over residue rings modulo square-free odd integers

Lin Wang; Yu Zhou; Ying Gao

doi:10.1587/transfun.E98.A.246

A tighter bound for the character sum of primitive sequences over residue rings modulo square-free odd integers

Lin Wang
, Yu Zhou
, Ying Gao

网络空间安全学院

Science and Technology on Communication Security Laboratory

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

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.

源语言	英语
页（从-至）	246-249
页数	4
期刊	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
卷	E98A
期	1
DOI	https://doi.org/10.1587/transfun.E98.A.246
出版状态	已出版 - 1 1月 2015

访问文件

10.1587/transfun.E98.A.246

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{6496223fd4304755abff10070747aa75,

title = "A tighter bound for the character sum of primitive sequences over residue rings modulo square-free odd integers",

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 mn/2.",

keywords = "Character sum, Linear recurring sequence, Primitive sequence, Residue ring",

author = "Lin Wang and Yu Zhou and Ying Gao",

note = "Publisher Copyright: Copyright {\textcopyright} 2015 The Institute of Electronics, Information and Communication Engineers.",

year = "2015",

month = jan,

day = "1",

doi = "10.1587/transfun.E98.A.246",

language = "英语",

volume = "E98A",

pages = "246--249",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "1",

}

TY - JOUR

T1 - A tighter bound for the character sum of primitive sequences over residue rings modulo square-free odd integers

AU - Wang, Lin

AU - Zhou, Yu

AU - Gao, Ying

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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 mn/2.

AB - 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 mn/2.

KW - Character sum

KW - Linear recurring sequence

KW - Primitive sequence

KW - Residue ring

UR - https://www.scopus.com/pages/publications/84924600064

U2 - 10.1587/transfun.E98.A.246

DO - 10.1587/transfun.E98.A.246

M3 - 文章

AN - SCOPUS:84924600064

SN - 0916-8508

VL - E98A

SP - 246

EP - 249

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 1

ER -

A tighter bound for the character sum of primitive sequences over residue rings modulo square-free odd integers

摘要

访问文件

其它文件与链接

指纹

引用此