Sequences with good correlation property based on depth and interleaving techniques
type: Item
instance of: scholarly article
title: Sequences with good correlation property based on depth and interleaving techniques
zbMATH Open document ID: 1329.94048
author: Min Zeng
author: Yuan Luo
author: Guang Gong
published in: Designs, Codes and Cryptography
publication date: 2015-09-30T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 6487935
zbMATH Keywords: complexity
zbMATH Keywords: correlation
zbMATH Keywords: depth
zbMATH Keywords: difference
zbMATH Keywords: interleaved sequence
zbMATH Keywords: ultimate period
MaRDI profile type: Publication
full work available at URL: s10623-014-0004-z
OpenAlex ID: W2055645149
cites work: Q4945528
cites work: Rotating-table games and derivatives of words
cites work: Q3996998
cites work: Q3864649
cites work: A fast algorithm for determining the linear complexity of a sequence with period \(p^n\) over GF\((q)\)
cites work: The depth distribution-a new characterization for linear codes
cites work: Linear complexity of de Bruijn sequences-old and new results
cites work: Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial
cites work: A fast algorithm for determining the complexity of a binary sequence with period&lt;tex&gt;2^n&lt;/tex&gt;(Corresp.)
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: A Three-Valued Walsh Transform From Decimations of Helleseth–Gong Sequences
cites work: A new family of ternary sequences with ideal two-level autocorrelation function
cites work: Q3216750
cites work: Q5248329
cites work: On the depth distribution of linear codes
cites work: On integer-valued rational polynomials and depth distributions of binary codes
cites work: Derivatives of Binary Sequences
cites work: New construction for families of binary sequences with optimal correlation properties
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: On evaluating the linear complexity of a sequence of least period \(2^ n\)
cites work: Q3840196
DOI: 10.1007/S10623-014-0004-Z
description: scientific article; zbMATH DE number 6487935