2017/01/18 by Lenny Fukshansky, Fukshansky, Lenny, A.A. Shaar +2
Computer Science · Engineering · Mathematics · #94.10 #94A12 #94A15 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Wireless Communication Networks Research #cs.IT #graph theory and CDMA systems #math.CO #math.IT #msc:94.10 #msc:94A12 #msc:94A15
paper · pdf · doi:10.48550/arxiv.1701.05209
8 pages, 5 tables; to appear in Advances in Mathematics of Communication
openalex publication_date 2017/01/18 · arxiv created 2017/12/08 · arxiv updated 2017/12/11 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
We present a new family of one-coincidence sequence sets suitable for frequency hopping code division multiple access (FH-CDMA) systems with dispersed (low density) sequence elements. These sets are derived from one-coincidence prime sequence sets, such that for each one-coincidence prime sequence set there is a new one-coincidence set comprised of sequences with dispersed sequence elements, required in some circumstances, for FH-CDMA systems. Getting rid of crowdedness of sequence elements is achieved by doubling the size of the sequence element alphabet. In addition, this doubling process eases control over the distance between adjacent sequence elements. Properties of the new sets are discussed.