ISCAS OpenIR  > 信息安全国家重点实验室
new results on periodic sequences with large k-error linear complexity
Hu Honggang; Gong Guang; Feng Dengguo
2009
Conference Name16th IEEE International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC 05)
SourceIEEE International Symposium on Information Theory - Proceedings
Pages4687-4694
Conference DateSEP 11-14,
Conference PlaceBerlin, GERMANY
Indexed Typesci,istp,ei,acm,ieee
Publish Place445 HOES LANE, PISCATAWAY, NJ 08855 USA
PublisherIEEE TRANSACTIONS ON INFORMATION THEORY
ISSN0018-9448
ISBN9781424422579
DepartmentHu, Honggang; Feng, Dengguo Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China. Hu, Honggang; Gong, Guang Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada.
English AbstractNiederreiter showed that there is a class of periodic sequences which possess large linear complexity and large k-error linear complexity simultaneously. This result disproved the conjecture that there exists a trade-off between the linear complexity and the k-error linear complexity of a periodic sequence by Ding et al. By considering the orders of the divisors of x(N)-1 over F-q, we obtain three main results which hold for much larger k than those of Niederreiter et al.: a) sequences with maximal linear complexity and almost maximal k-error linear complexity with general periods; b) sequences with maximal linear complexity and maximal k-error linear complexity with special periods; c) sequences with maximal linear complexity and almost maximal k-error linear complexity in the asymptotic case with composite periods. Besides, we also construct some periodic sequences with low correlation and large k-error linear complexity.
KeywordCorrelation Cyclotomy Entropy Function K-error Linear Complexity Linear Complexity Periodic Sequence
SponsorshipIEEE
Language英语
WOS IDWOS:000269839000025
Citation statistics
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/8182
Collection信息安全国家重点实验室
Recommended Citation
GB/T 7714
Hu Honggang,Gong Guang,Feng Dengguo. new results on periodic sequences with large k-error linear complexity[C]. 445 HOES LANE, PISCATAWAY, NJ 08855 USA:IEEE TRANSACTIONS ON INFORMATION THEORY,2009:4687-4694.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Hu Honggang]'s Articles
[Gong Guang]'s Articles
[Feng Dengguo]'s Articles
Baidu academic
Similar articles in Baidu academic
[Hu Honggang]'s Articles
[Gong Guang]'s Articles
[Feng Dengguo]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Hu Honggang]'s Articles
[Gong Guang]'s Articles
[Feng Dengguo]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.