Processing math: 0%
On the 4-Adic Complexity of Quaternary Sequences of Period <span class="MathJax_Preview">2p</span><script type="math/tex">2p</script> with Ideal Autocorrelation | IEEE Conference Publication | IEEE Xplore

On the 4-Adic Complexity of Quaternary Sequences of Period 2p with Ideal Autocorrelation


Abstract:

In this paper, we study the 4-adic complexity of two classes of quaternary sequences of period 2p with ideal autocorrelation defined by Kim et al. (ISIT, 2009). Our res...Show More

Abstract:

In this paper, we study the 4-adic complexity of two classes of quaternary sequences of period 2p with ideal autocorrelation defined by Kim et al. (ISIT, 2009). Our results show that the 4-adic complexity of these two kinds of quaternary sequences is large enough to resist the attack of the rational approximation algorithm.
Date of Conference: 12-20 July 2021
Date Added to IEEE Xplore: 01 September 2021
ISBN Information:
Conference Location: Melbourne, Australia

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.