Paper Info
Title
Frequency/Time hopping sequences with large linear complexities
Abstract
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk) by taking successive k-tuples of given sequences over GF(p). We are able to characterize those p-ary sequences whose k-tuple versions now over GF(pk) have the maximum possible linear complexities (LCs). Next, we consider the FH/TH sequence generators composed of a combinatorial function generator and some buffers. We are able to characterize the generators whose output FH/TH sequences over GF(pk) have the maximum possible LC for the given algebraic normal form.
Year
DOI
Venue
2005
10.1007/11779360_30
WCC
Keywords
Field
DocType
p-ary sequence,th sequence generator,successive k-tuples,combinatorial function generator,maximum possible linear complexity,maximum possible lc,th sequence,large linear complexity,algebraic normal form,output fh,k-tuple version,time hopping
Discrete mathematics,Combinatorics,Linear feedback shift register,Function generator,Hardware complexity,Pseudorandom binary sequence,Minimal polynomial (linear algebra),Algebraic normal form,Linear complexity,Time-hopping,Mathematics
Conference
Volume
ISSN
ISBN
3969
0302-9743
3-540-35481-6
Citations 
PageRank 
References 
0
0.34
5
Authors
2
Name
Order
Citations
PageRank
Yun-Pyo Hong1243.41
Hong-Yeop Song232951.84