Sequences are used for achieving non-linearity in a cryptosystem, and they are important in Code Division Multiple Access CDMA to ensure a proper communication. In this study, we show a method for obtaining cryptographic functions from p-ary sequences with s consecutive zero-symbols of type γ1, γ2 . In fact, most of the cases we obtain functions with the highest non-linearity, i.e. generalized bent functions. In CDMA, instead of distributing time and frequency sources to users, each user is given a unique sequence to transmit data at the same frequency and time. In this study, we examined the bit-error-rate BER performance of p-ary sequences with s consecutive zero-symbols of type γ1, γ2 on CDMA.
nearly perfect sequences cryptographic functions generalized bent function CDMA bit-error-rate
Primary Language | English |
---|---|
Journal Section | Research Article |
Authors | |
Publication Date | September 1, 2019 |
Published in Issue | Year 2019 Volume: 8 Issue: 3 |