-
1
-
-
3042841067
-
Regular cosets and upper bounds on the linear complexity of certain sequences
-
Sequences and Their Applications-SETA'98, Berlin: Springer-Verlag
-
Caballero-Gil P. Regular cosets and upper bounds on the linear complexity of certain sequences. Sequences and Their Applications-SETA'98. Lecture Notes in Computer Science. 1999;161-170 Springer-Verlag, Berlin.
-
(1999)
Lecture Notes in Computer Science
, pp. 161-170
-
-
Caballero-Gil, P.1
-
2
-
-
84955600047
-
On the linear complexity of nonlinearly filtered PN-sequences
-
Advances in Cryptology-ASIACRYPT'94, Berlin: Springer-Verlag
-
Fúster-Sabater A., Caballero-Gil P. On the linear complexity of nonlinearly filtered PN-sequences. Advances in Cryptology-ASIACRYPT'94. Lecture Notes in Computer Science. vol. 917:1995;80-90 Springer-Verlag, Berlin.
-
(1995)
Lecture Notes in Computer Science
, vol.917
, pp. 80-90
-
-
Fúster-Sabater, A.1
Caballero-Gil, P.2
-
3
-
-
84937741493
-
Optimal binary sequences for spread spectrum multiplexing
-
Gold R. Optimal binary sequences for spread spectrum multiplexing. IEEE Trans. Inform. Theory. IT-14:1968;154-156.
-
(1968)
IEEE Trans. Inform. Theory
, vol.IT-14
, pp. 154-156
-
-
Gold, R.1
-
4
-
-
0003749143
-
Weight distribution formula for some class of cyclic codes
-
Coordinated Science Laboratory, University of Illinois, Urbana, (AD632574)
-
T. Kasami, Weight distribution formula for some class of cyclic codes, Coordinated Science Laboratory, University of Illinois, Urbana, Technical Report R-285 (AD632574), 1966.
-
(1966)
Technical Report
, vol.R-285
-
-
Kasami, T.1
-
5
-
-
0017017134
-
An analysis of the structure and complexity of nonlinear binary sequence generators
-
Key E.L. An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory. IT-22:1976;732-736.
-
(1976)
IEEE Trans. Inform. Theory
, vol.IT-22
, pp. 732-736
-
-
Key, E.L.1
-
6
-
-
0020849105
-
Bounds on the linear span of bent sequences
-
Kumar P.V., Scholtz R.A. Bounds on the linear span of bent sequences. IEEE Trans. Inform. Theory. IT-29:1983;854-862.
-
(1983)
IEEE Trans. Inform. Theory
, vol.IT-29
, pp. 854-862
-
-
Kumar, P.V.1
Scholtz, R.A.2
-
7
-
-
0020202995
-
Maximal families of bent sequences
-
Lempel A., Cohn M. Maximal families of bent sequences. IEEE Trans. Inform. Theory. IT-28:1982;865-868.
-
(1982)
IEEE Trans. Inform. Theory
, vol.IT-28
, pp. 865-868
-
-
Lempel, A.1
Cohn, M.2
-
9
-
-
84937740421
-
Shift-register synthesis and BCH decoding
-
Massey J.L. Shift-register synthesis and BCH decoding. IEEE Tran. Inform. Theory. IT-15:1969.
-
(1969)
IEEE Tran. Inform. Theory
, vol.IT-15
-
-
Massey, J.L.1
-
10
-
-
0000937205
-
A Fourier transform approach to the linear complexity of nonlinearly filtered sequences
-
Advances in Cryptology-CRYPTO'94, Berlin: Springer-Verlag
-
Massey J.L., Serconek S. A Fourier transform approach to the linear complexity of nonlinearly filtered sequences. Advances in Cryptology-CRYPTO'94. Lecture Notes in Computer Science. vol. 839:1994;332-340 Springer-Verlag, Berlin.
-
(1994)
Lecture Notes in Computer Science
, vol.839
, pp. 332-340
-
-
Massey, J.L.1
Serconek, S.2
-
11
-
-
0024628422
-
A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span
-
No J.S., Kumar P.V. A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span. IEEE Trans. Inform. Theory. IT-35:1989;371-379.
-
(1989)
IEEE Trans. Inform. Theory
, vol.IT-35
, pp. 371-379
-
-
No, J.S.1
Kumar, P.V.2
|