• 
  Tuvi Etzion, Abraham Lempel:
  On the distribution of de Bruijn sequences of given complexity. IEEE Trans. Inf. Theory 30(4): 611-614 (1984)
• 
  Tuvi Etzion, Abraham Lempel:
  Construction of de Bruijn sequences of minimal complexity. IEEE Trans. Inf. Theory 30(5): 705-708 (1984)
• 1983
• 
  Abraham Lempel, Gadiel Seroussi, Shmuel Winograd:
  On the Complexity of Multiplication in Finite Fields. Theor. Comput. Sci. 22: 285-296 (1983)
• 
  Gadiel Seroussi, Abraham Lempel:
  Maximum likelihood decoding of certain Reed - Muller codes. IEEE Trans. Inf. Theory 29(3): 448-450 (1983)
• 1982
• 
  Abraham Lempel, Martin L. Cohn:
  Maximal families of bent sequences. IEEE Trans. Inf. Theory 28(6): 865-868 (1982)
• 
  Abraham Lempel, Martin L. Cohn:
  Look-ahead coding for input- restricted channels. IEEE Trans. Inf. Theory 28(6): 933-937 (1982)
• 
  Abraham Lempel, Gadiel Seroussi, Jacob Ziv:
  On the power of straight- line computations in finite fields. IEEE Trans. Inf. Theory 28(6): 875-879 (1982)
• 
  Shimon Even, Oded Goldreich, Abraham Lempel:
  A Randomized Protocol for Signing Contracts. CRYPTO 1982: 205-210
• 1980
• 
  Gadiel Seroussi, Abraham Lempel:
  Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields. SIAM J. Comput. 9(4): 758-767 (1980)
• 1979
• 
  Abraham Lempel:
  Cryptology in Transition. ACM Comput. Surv. 11(4): 285-303 (1979)
• 1978
• 
  Jacob Ziv, Abraham Lempel:
  Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5): 530-536 (1978)
• 1977
• 
  Martin Cohn, Abraham Lempel:
  On fast M-sequence transforms (Corresp.). IEEE Trans. Inf. Theory 23(1): 135-137 (1977)
• 
  Abraham Lempel, Martin Cohn, Willard L. Eastman:
  A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Inf. Theory 23(1): 38-42 (1977)
• 
  Abraham Lempel, Shmuel Winograd:
  A new approach to error-correcting codes. IEEE Trans. Inf. Theory 23(4): 503-508 (1977)
• 
  Jacob Ziv, Abraham Lempel:
  A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3): 337-343 (1977)
• 1976
• 
  Abraham Lempel, Jacob Ziv:
  On the Complexity of Finite Sequences. IEEE Trans. Inf. Theory 22(1): 75-81 (1976)
• 1975
• 
  Abraham Lempel:
  Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2ⁿ). SIAM J. Comput. 4(2): 175-186 (1975)
• 
  Martin Cohn, Abraham Lempel:
  Difference codes with desirable spectral properties (Corresp.). IEEE Trans. Inf. Theory 21(5): 593-596 (1975)
• 1974
• 
  Frank Harary, Abraham Lempel:
  On clique-extremal (p, q)-graphs. Networks 4(4): 371-378 (1974)
• 
  Abraham Lempel, Haim Greenberger:
  Families of sequences with optimal Hamming-correlation properties. IEEE Trans. Inf. Theory 20(1): 90-94 (1974)
• 1973
• 
  Abraham Lempel, Shimon Even, Martin Cohn:
  An algorithm for optimal prefix parsing of a noiseless and memoryless channel. IEEE Trans. Inf. Theory 19(2): 208-214 (1973)
• 1972
• 
  Shimon Even, Abraham Lempel:
  Generation and Enumeration of All Solutions of the Characteristic Sum Condition. Inf. Control. 21(5): 476-482 (1972)
• 
  Shimon Even, Amir Pnueli, Abraham Lempel:
  Permutation Graphs and Transitive Graphs. J. ACM 19(3): 400-410 (1972)
• 
  Martin Cohn, Abraham Lempel:
  Cycle Decomposition by Disjoint Transpositions. J. Comb. Theory, Ser. A 13(1): 83-89 (1972)
• 1971
• 
  Abraham Lempel, Willard L. Eastman:
  High Speed Generation of Maximal Length Sequences. IEEE Trans. Computers 20(2): 227-229 (1971)
• 
  Abraham Lempel:
  Analysis and synthesis of polynomials and sequences over GF(2). IEEE Trans. Inf. Theory 17(3): 297-303 (1971)
• 1970
• 
  Abraham Lempel:
  On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers. IEEE Trans. Computers 19(12): 1204-1209 (1970)
• 1969
• 
  Abraham Lempel:
  On k-Stable Feedback Shift Registers. IEEE Trans. Computers 18(7): 652-660 (1969)

[<< prev] #30 -- #57