Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Binary sequence")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 905

  • Page / 37
Export

Selection :

  • and

Two New Families of Optimal Binary Sequences Obtained From Quaternary SequencesXIAOHU TANG; HELLESETH, Tor; LEI HU et al.IEEE transactions on information theory. 2009, Vol 55, Num 4, pp 1833-1840, issn 0018-9448, 8 p.Article

Wavelength Isolation Sequence DesignJEDWAB, Jonathan; STRANGE, Mark.IEEE transactions on information theory. 2013, Vol 59, Num 5, pp 3210-3214, issn 0018-9448, 5 p.Article

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

A New Algorithm to Compute Remote Terms in Special Types of Characteristic SequencesGIULIANI, Kenneth J; GUANG GONG.Lecture notes in computer science. 2006, pp 237-247, issn 0302-9743, isbn 3-540-44523-4, 1Vol, 11 p.Conference Paper

Characterizing the autocorrelations of binary sequencesMARTINS DE CARVALHO, J. L; CLARK, J. M. C.IEEE transactions on information theory. 1983, Vol 29, Num 4, pp 502-508, issn 0018-9448Article

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

A Note on Large Families of Pseudorandom Binary Sequences and LatticesHUANING LIU; JING GAO.Journal of information science and engineering. 2014, Vol 30, Num 5, pp 1635-1654, issn 1016-2364, 20 p.Article

Autocorrelations of Binary Sequences and Run StructureWILLMS, Jürgen.IEEE transactions on information theory. 2013, Vol 59, Num 8, pp 4985-4993, issn 0018-9448, 9 p.Article

A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear spanJONG-SEON NO; VIJAY KUMAR, P.IEEE transactions on information theory. 1989, Vol 35, Num 2, pp 371-379, issn 0018-9448, 9 p.Article

Improper decimation of m-sequencesSHI WEN-HONG; CHEN JIN-GUANG.Electronics Letters. 1987, Vol 23, Num 5, pp 210-211, issn 0013-5194Article

On a method of detection of nonperiodic pseudonase binary sequencesPROUZA, L.Kybernetika. 1984, Vol 20, Num 4, pp 314-321, issn 0023-5954Article

On the detection of a complex finite binary sequence in the presence of an interfering complex binary sequencePROUZA, L.Kybernetika. 1983, Vol 19, Num 5, pp 408-413, issn 0023-5954Article

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

  • Page / 37