Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
DOI10.1109/18.681324zbMath0941.94015OpenAlexW2147883795MaRDI QIDQ4701120
Mohammad Umar Siddiqi, Parampalli Udaya
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.681324
finite fieldsGalois ringlinear complexity\(m\)-sequencesfrequency hopping patternsHamming cross-correlation functionmultiple access communication systemssequences over finite rings
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items (22)
This page was built for publication: Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings