 | 1996 |
|---|
| 44 |       | Amnon Gavish,
Abraham Lempel:
Match-length functions for data compression.
IEEE Transactions on Information Theory 42(5): 1375-1380 (1996) |
| 1995 |
|---|
| 43 | | Dafna Sheinwald,
Abraham Lempel,
Jacob Ziv:
On Encoding and Decoding with Two-Way Head Machines
Inf. Comput. 116(1): 128-133 (1995) |
| 1994 |
|---|
| 42 | | Amnon Gavish,
Abraham Lempel:
On ternary complementary sequences.
IEEE Transactions on Information Theory 40(2): 522-526 (1994) |
| 1993 |
|---|
| 41 | | Abraham Lempel,
Gadiel Seroussi:
Application of Finte Fields to Memory Interleaving.
AAECC 1993: 244-256 |
| 40 | | Amnon Gavish,
Abraham Lempel:
On Complementary Sequences.
Algebraic Coding 1993: 126-140 |
| 1992 |
|---|
| 39 | | Marcelo J. Weinberger,
Abraham Lempel,
Jacob Ziv:
On the Coding Delay of a General Coder.
Data Compression Conference 1992: 102-111 |
| 38 | | Abraham Lempel,
Gadiel Seroussi:
Systematic derivation of spline bases.
Computer Aided Geometric Design 9(5): 349-363 (1992) |
| 37 | | Ron M. Roth,
Abraham Lempel:
t-sum generators of finite Abelian groups.
Discrete Mathematics 103(3): 279-292 (1992) |
| 36 | | Marcelo J. Weinberger,
Jacob Ziv,
Abraham Lempel:
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences.
IEEE Transactions on Information Theory 38(2): 380-385 (1992) |
| 35 | | Marcelo J. Weinberger,
Abraham Lempel,
Jacob Ziv:
A sequential algorithm for the universal coding of finite memory sources.
IEEE Transactions on Information Theory 38(3): 1002-1014 (1992) |
| 1991 |
|---|
| 34 | | Dafna Sheinwald,
Abraham Lempel,
Jacob Ziv:
On Compression with Two-Way Head Machines.
Data Compression Conference 1991: 218-227 |
| 33 | | Marcelo J. Weinberger,
Jacob Ziv,
Abraham Lempel:
On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual Sequences.
Data Compression Conference 1991: 239-246 |
| 32 | | Abraham Lempel,
Gadiel Seroussi:
Explicit formulas for self-complementary normal bases in certain finite fields.
IEEE Transactions on Information Theory 37(4): 1220-1222 (1991) |
| 1990 |
|---|
| 31 | | Marcelo J. Weinberger,
Abraham Lempel:
Factorization of symmetric circulant matrices in finite fields.
Discrete Applied Mathematics 28(3): 271-285 (1990) |
| 30 | | Ron M. Roth,
Abraham Lempel:
Application of circulant matrices to the construction and decoding of linear codes.
IEEE Transactions on Information Theory 36(5): 1157-1163 (1990) |
| 1989 |
|---|
| 29 | | Ron M. Roth,
Abraham Lempel:
A construction of non-Reed-Solomon type MDS codes.
IEEE Transactions on Information Theory 35(3): 655-657 (1989) |
| 28 | | Ron M. Roth,
Abraham Lempel:
On MDS codes via Cauchy matrices.
IEEE Transactions on Information Theory 35(6): 1314-1319 (1989) |
| 1988 |
|---|
| 27 | | Ron M. Roth,
Abraham Lempel:
Composition of Reed-Solomon codes and geometric designs.
IEEE Transactions on Information Theory 34(4): 810-816 (1988) |
| 26 | | Abraham Lempel,
Marcelo J. Weinberger:
Self-Complementary Normal Bases in Finite Fields.
SIAM J. Discrete Math. 1(2): 193-198 (1988) |
| 1986 |
|---|
| 25 | | Abraham Lempel,
Jacob Ziv:
Compression of two-dimensional data.
IEEE Transactions on Information Theory 32(1): 2-8 (1986) |
| 24 | | Abraham Lempel:
On multiset decipherable codes.
IEEE Transactions on Information Theory 32(5): 714-716 (1986) |
| 23 | | Tuvi Etzion,
Abraham Lempel:
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network.
SIAM J. Comput. 15(1): 216-221 (1986) |
| 1985 |
|---|
| 22 | | Shimon Even,
Oded Goldreich,
Abraham Lempel:
A Randomized Protocol for Signing Contracts.
Commun. ACM 28(6): 637-647 (1985) |
| 21 | | Gérard D. Cohen,
Abraham Lempel:
Linear intersecting codes.
Discrete Mathematics 56(1): 35-43 (1985) |
| 20 | | Abraham Lempel,
Martin Cohn:
Design of universal test sequences for VLSI.
IEEE Transactions on Information Theory 31(1): 10-17 (1985) |
| 1984 |
|---|
| 19 | | Tuvi Etzion,
Abraham Lempel:
Algorithms for the generation of full-length shift-register sequences.
IEEE Transactions on Information Theory 30(3): 480-484 (1984) |
| 18 | | Tuvi Etzion,
Abraham Lempel:
On the distribution of de Bruijn sequences of given complexity.
IEEE Transactions on Information Theory 30(4): 611-614 (1984) |
| 17 | | Tuvi Etzion,
Abraham Lempel:
Construction of de Bruijn sequences of minimal complexity.
IEEE Transactions on Information Theory 30(5): 705-708 (1984) |
| 16 | | Gadiel Seroussi,
Abraham Lempel:
On Symmetric Algorithms for Bilinear Forms over Finite Fields.
J. Algorithms 5(3): 327-344 (1984) |
| 1983 |
|---|
| 15 | | Gadiel Seroussi,
Abraham Lempel:
Maximum likelihood decoding of certain Reed - Muller codes.
IEEE Transactions on Information Theory 29(3): 448-450 (1983) |
| 14 | | Abraham Lempel,
Gadiel Seroussi,
Shmuel Winograd:
On the Complexity of Multiplication in Finite Fields.
Theor. Comput. Sci. 22: 285-296 (1983) |
| 1982 |
|---|
| 13 |  | Shimon Even,
Oded Goldreich,
Abraham Lempel:
A Randomized Protocol for Signing Contracts.
CRYPTO 1982: 205-210 |
| 12 | | Abraham Lempel,
Martin L. Cohn:
Maximal families of bent sequences.
IEEE Transactions on Information Theory 28(6): 865-868 (1982) |
| 11 | | Abraham Lempel,
Gadiel Seroussi,
Jacob Ziv:
On the power of straight- line computations in finite fields.
IEEE Transactions on Information Theory 28(6): 875-879 (1982) |
| 10 | | Abraham Lempel,
Martin L. Cohn:
Look-ahead coding for input- restricted channels.
IEEE Transactions on Information Theory 28(6): 933-937 (1982) |
| 1980 |
|---|
| 9 | | Gadiel Seroussi,
Abraham Lempel:
Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields.
SIAM J. Comput. 9(4): 758-767 (1980) |
| 1979 |
|---|
| 8 | | Abraham Lempel:
Cryptology in Transition.
ACM Comput. Surv. 11(4): 285-303 (1979) |
| 1978 |
|---|
| 7 | | Jacob Ziv,
Abraham Lempel:
Compression of Individual Sequences via Variable-Rate Coding.
IEEE Transactions on Information Theory 24(5): 530-536 (1978) |
| 1977 |
|---|
| 6 | | Jacob Ziv,
Abraham Lempel:
A Universal Algorithm for Sequential Data Compression.
IEEE Transactions on Information Theory 23(3): 337-343 (1977) |
| 1976 |
|---|
| 5 | | Abraham Lempel,
Jacob Ziv:
On the Complexity of Finite Sequences.
IEEE Transactions on Information Theory 22(1): 75-81 (1976) |
| 1975 |
|---|
| 4 | | Abraham Lempel:
Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2n).
SIAM J. Comput. 4(2): 175-186 (1975) |
| 1972 |
|---|
| 3 | | Shimon Even,
Abraham Lempel:
Generation and Enumeration of All Solutions of the Characteristic Sum Condition
Information and Control 21(5): 476-482 (1972) |
| 2 | | Shimon Even,
Amir Pnueli,
Abraham Lempel:
Permutation Graphs and Transitive Graphs.
J. ACM 19(3): 400-410 (1972) |
| 1 | | Martin Cohn,
Abraham Lempel:
Cycle Decomposition by Disjoint Transpositions.
J. Comb. Theory, Ser. A 13(1): 83-89 (1972) |
Data released under the ODC-BY 1.0 license — See also our legal information page