Sequences and their applications (SETA 2006)Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-44523-4, 1Vol, XII-431 p, isbn 3-540-44523-4Conference Proceedings

The logical strength of the uniform continuity theoremBERGER, Josef.Lecture notes in computer science. 2006, pp 35-39, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 5 p.Conference Paper

Extreme weight classes of de Bruijn sequencesMAYHEW, Gregory L.Discrete mathematics. 2002, Vol 256, Num 1-2, pp 495-497, issn 0012-365XArticle

The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequencesMERKLE, Wolfgang.Lecture notes in computer science. 2002, pp 390-400, issn 0302-9743, isbn 3-540-43864-5, 11 p.Conference Paper

Crosscorrelation Properties of Binary Sequences with Ideal Two-Level AutocorrelationNAM YUL YU; GUANG GONG.Lecture notes in computer science. 2006, pp 104-118, issn 0302-9743, isbn 3-540-44523-4, 1Vol, 15 p.Conference Paper

Generalized binary udaya-siddiqi sequencesXIAOHU TANG; UDAYA, Parampalli; PINGZHI FAN et al.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 85Conference Paper

Hénon stream cipherERDMANN, D; MURPHY, S.Electronics Letters. 1992, Vol 28, Num 9, pp 893-895, issn 0013-5194Article

General proof of phase relation between an m-sequence and its sampled sequenceSHI WEN-HONG; CHEN JIN-GUANG.Electronics Letters. 1986, Vol 22, Num 17, pp 908-909, issn 0013-5194Article

Expected value of the linear complexity of two-dimensional binary sequencesXIUTAO FENG; ZONGDUO DAI.Lecture notes in computer science. 2005, pp 113-128, issn 0302-9743, isbn 3-540-26084-6, 16 p.Conference Paper

The number of cross-join pairs in maximum length linear sequencesHELLESETH, T; KLØVE, T.IEEE transactions on information theory. 1991, Vol 37, Num 6, pp 1731-1733, issn 0018-9448Article

On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequencesHONGGANG HU; DENGGUO FENG.Lecture notes in computer science. 2005, pp 185-196, issn 0302-9743, isbn 3-540-26084-6, 12 p.Conference Paper

Which irreducible polynomials divide trinomials over GF(2)?GOLOMB, Solomon W; LEE, Pey-Feng.Lecture notes in computer science. 2005, pp 414-424, issn 0302-9743, isbn 3-540-26084-6, 11 p.Conference Paper

New constructions of large binary sequences family with low correlationXIN TONG; JIE ZHANG; WEN, Qiao-Yan et al.Lecture notes in computer science. 2006, pp 42-53, issn 0302-9743, isbn 3-540-49608-4, 1Vol, 12 p.Conference Paper

Autocorrelation properties of a class of infinite binary sequencesHØHOLDT, T; JENSEN, H. E; JUSTESEN, J et al.IEEE transactions on information theory. 1986, Vol 32, Num 3, pp 430-431, issn 0018-9448Article

Periods of de Bruijn sequencesGOLOMB, S. W.Advances in applied mathematics (Print). 1992, Vol 13, Num 2, pp 152-159, issn 0196-8858Article

Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6TINGYAO XIONG; HALL, Jonathan I.IEEE transactions on information theory. 2008, Vol 54, Num 2, pp 931-935, issn 0018-9448, 5 p.Article

Nonbinary kasami sequences over GF(p)LIU, S. C; KOMO, J. J.IEEE transactions on information theory. 1992, Vol 38, Num 4, pp 1409-1412, issn 0018-9448Article

An efficient algorithm for the generation of DeBruijn cyclesJANSEN, C. J. A; FRANX, W. G; BOEKEE, D. E et al.IEEE transactions on information theory. 1991, Vol 37, Num 5, pp 1475-1478, issn 0018-9448Article

The linear complexity of binary sequences with period (2ⁿ-1)^kCHENG HUA; GUO-ZHEN XIAO.IEEE transactions on information theory. 1991, Vol 37, Num 3, pp 672-673, issn 0018-9448, 1Article

New families of p-ary sequences from quadratic form with low correlation and large linear spanXIAOHU TANG; UDAYA, Parampalli; PINGZHI FAN et al.Lecture notes in computer science. 2005, pp 255-265, issn 0302-9743, isbn 3-540-26084-6, 11 p.Conference Paper

Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequencesZONGDUO DAI; SHAOQUAN JIANG; IMAMURA, Kyoki et al.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 123Conference Paper

Binary shaping for low-duty-cycle communicationsBARRON, Richard J.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 514Conference Paper

Couples de suites binaires de longueur maximale ayant une corrélation croisée à trois valeurs : conjecture de Welch = Binary m-sequences with three-valued crosscorrelation : a proof of Welch's conjectureCANTEAUT, A; CHARPIN, P; DOBBERTIN, H et al.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1999, Vol 328, Num 2, pp 173-178, issn 0764-4442Article

On the existence of Turyn sequences of length less than 43EDMONDSON, G. M; SEBERRY, J; ANDERSON, M. R et al.Mathematics of computation. 1994, Vol 62, Num 205, pp 351-362, issn 0025-5718Article

Efficient simultaneous correlation of M mutually orthogonal complementary sets of sequencesHADAD, M. N; FUNES, M. A; DONATO, P. G et al.Electronics letters. 2011, Vol 47, Num 11, pp 673-675, issn 0013-5194, 3 p.Article