2-adic complexity of binary sequences with interleaved structure
type: Item
instance of: scholarly article
title: 2-adic complexity of binary sequences with interleaved structure
zbMATH Open document ID: 1368.94080
author: Hai Xiong
author: Longjiang Qu
author: Chao Li
published in: Finite Fields and their Applications
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 11B50
zbMATH DE Number: 6756429
zbMATH Keywords: 2-Adic complexity
zbMATH Keywords: interleaved sequence
zbMATH Keywords: interleaved structure
zbMATH Keywords: LCZ sequence
zbMATH Keywords: optimal autocorrelation sequence
zbMATH Keywords: binary sequence
MaRDI profile type: Publication
full work available at URL: j.ffa.2014.09.009
OpenAlex ID: W2036676363
cites work: Almost difference sets and their sequences with optimal autocorrelation
cites work: Binary Almost-Perfect Sequence Sets
cites work: Q5713307
cites work: Theory and applications of q-ary interleaved sequences
cites work: New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case
cites work: On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences
cites work: Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”
cites work: Perfect and almost perfect sequences
cites work: New Design of Low-Correlation Zone Sequence Sets
cites work: 2-Adic shift registers
cites work: Q4343440
cites work: Feedback shift registers, 2-adic span, and combiners with memory
cites work: On the Linear Complexity of Binary Sequences of Period $4N$ With Optimal Autocorrelation Value/Magnitude
cites work: On the existence of cyclic Hadamard difference sets
cites work: New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
cites work: New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
cites work: $2$-Adic Complexity of Binary $m$-Sequences
cites work: The Linear Complexity of Binary Sequences With Optimal Autocorrelation
cites work: A New Method to Compute the 2-Adic Complexity of Binary Sequences
cites work: New Binary Sequences With Optimal Autocorrelation Magnitude
cites work: A New Class of Sequences With Zero or Low Correlation Zone Based on Interleaving Technique
DOI: 10.1016/J.FFA.2014.09.009
description: scientific article; zbMATH DE number 6756429