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

New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation ValueXIAOHU TANG; CUNSHENG DING.IEEE transactions on information theory. 2010, Vol 56, Num 12, pp 6398-6405, issn 0018-9448, 8 p.Article

Binary sequences with merit factor greater than 6.34BORWEIN, Peter; KWOK-KWONG STEPHEN CHOI; JEDWAB, Jonathan et al.IEEE transactions on information theory. 2004, Vol 50, Num 12, pp 3234-3249, issn 0018-9448, 16 p.Article

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

A generalized method for encoding and decoding run-length-limited binary sequencesBEENKER, G. F. M; IMMINK, K. A. S.IEEE transactions on information theory. 1983, Vol 29, Num 5, pp 751-754, issn 0018-9448Article

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

Méthode polynomiale pour le calcul d'une convolution de séquences complexesLEVSHIN, V. P; SIMONOV, A. I.Radiotehnika i èlektronika. 1985, Vol 30, Num 6, pp 1105-1111, issn 0033-8494Article

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

Distribution des longueurs maximale et minimale des sériesBESKIN, L. N.Sibirskij matematičeskij žurnal. 1985, Vol 26, Num 6, pp 153-158, issn 0037-4474Article

Position recovery using binary sequencesARAZI, B.Electronics Letters. 1984, Vol 20, Num 2, pp 61-62, issn 0013-5194Article

New Constructions of Binary Sequences With Optimal Autocorrelation Value/MagnitudeXIAOHU TANG; GUANG GONG.IEEE transactions on information theory. 2010, Vol 56, Num 3, pp 1278-1286, issn 0018-9448, 9 p.Article

New Binary Sequences With Optimal Autocorrelation MagnitudeNAM YUL YU; GUANG GONG.IEEE transactions on information theory. 2008, Vol 54, Num 10, pp 4771-4779, issn 0018-9448, 9 p.Article

Results on the nonlinear span of binary sequencesRIZOMILIOTIS, Panagiotis; KALOUPTSIDIS, Nicholas.IEEE transactions on information theory. 2005, Vol 51, Num 4, pp 1555-1563, issn 0018-9448, 9 p.Article

New sets of optimal p-ary low-correlation zone sequencesJANG, Ji-Woong; NO, Jong-Seon; HABONG CHUNG et al.IEEE transactions on information theory. 2007, Vol 53, Num 2, pp 815-821, issn 0018-9448, 7 p.Article

A PERFORMANCE ANALYSIS OF A SIMPLE PRIME-TESTING ALGORITHMWUNDERLICH MC.1983; MATHEMATICS OF COMPUTATION; ISSN 0025-5718; USA; DA. 1983; VOL. 40; NO 162; PP. 709-714; BIBL. 7 REF.Article

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