Abraham Lempel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 56 from 56

1996

Match-length functions for data compressionAmnon Gavish, Abraham Lempel. TIT, 42(5):1375-1380, 1996.

1995

On Encoding and Decoding with Two-Way Head MachinesDafna Sheinwald, Abraham Lempel, Jacob Ziv. iandc, 116(1):128-133, January 1995.

1994

On ternary complementary sequencesAmnon Gavish, Abraham Lempel. TIT, 40(2):522, 1994.

1993

On Complementary SequencesAmnon Gavish, Abraham Lempel. fiwac 1993: 126-140

Application of Finte Fields to Memory InterleavingAbraham Lempel, Gadiel Seroussi. AAECC 1993: 244-256

1992

Systematic derivation of spline basesAbraham Lempel, Gadiel Seroussi. cagd, 9(5):349-363, 1992. [doi]

t-sum generators of finite Abelian groupsRon M. Roth, Abraham Lempel. DM, 103(3):279-292, 1992. [doi]

A sequential algorithm for the universal coding of finite memory sourcesMarcelo J. Weinberger, Abraham Lempel, Jacob Ziv. TIT, 38(3):1002-1014, 1992.

On the optimal asymptotic performance of universal ordering and of discrimination of individual sequencesMarcelo J. Weinberger, Jacob Ziv, Abraham Lempel. TIT, 38(2):380-385, 1992.

On the Coding Delay of a General CoderMarcelo J. Weinberger, Abraham Lempel, Jacob Ziv. dcc 1992: 102-111

1991

Explicit formulas for self-complementary normal bases in certain finite fieldsAbraham Lempel, Gadiel Seroussi. TIT, 37(4):1220, 1991.

On Compression with Two-Way Head MachinesDafna Sheinwald, Abraham Lempel, Jacob Ziv. dcc 1991: 218-227

On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual SequencesMarcelo J. Weinberger, Jacob Ziv, Abraham Lempel. dcc 1991: 239-246

1990

Application of circulant matrices to the construction and decoding of linear codesRon M. Roth, Abraham Lempel. TIT, 36(5):1157, 1990.

Two-dimensional encoding by finite-state encodersDafna Sheinwald, Abraham Lempel, Jacob Ziv. tcom, 38(3):341-347, 1990. [doi]

Factorization of symmetric circulant matrices in finite fieldsMarcelo J. Weinberger, Abraham Lempel. DAM, 28(3):271-285, 1990. [doi]

1989

On MDS codes via Cauchy matricesRon M. Roth, Abraham Lempel. TIT, 35(6):1314, 1989.

A construction of non-Reed-Solomon type MDS codesRon M. Roth, Abraham Lempel. TIT, 35(3):655, 1989.

1988

Self-Complementary Normal Bases in Finite FieldsAbraham Lempel, Marcelo J. Weinberger. siamdm, 1(2):193-198, 1988.

Composition of Reed-Solomon codes and geometric designsRon M. Roth, Abraham Lempel. TIT, 34(4):810-816, 1988.

1986

An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange NetworkTuvi Etzion, Abraham Lempel. SICOMP, 15(1):216-221, 1986.

On multiset decipherable codesAbraham Lempel. TIT, 32(5):714, 1986.

Compression of two-dimensional dataAbraham Lempel, Jacob Ziv. TIT, 32(1):2-8, 1986.

1985

Linear intersecting codesGérard D. Cohen, Abraham Lempel. DM, 56(1):35-43, 1985. [doi]

A Randomized Protocol for Signing ContractsShimon Even, Oded Goldreich, Abraham Lempel. CACM, 28(6):637-647, 1985.

Design of universal test sequences for VLSIAbraham Lempel, Martin Cohn. TIT, 31(1):10-17, 1985.

1984

Construction of de Bruijn sequences of minimal complexityTuvi Etzion, Abraham Lempel. TIT, 30(5):705-708, 1984.

Algorithms for the generation of full-length shift-register sequencesTuvi Etzion, Abraham Lempel. TIT, 30(3):480-484, 1984.

On the distribution of de Bruijn sequences of given complexityTuvi Etzion, Abraham Lempel. TIT, 30(4):611-614, 1984.

On Symmetric Algorithms for Bilinear Forms over Finite FieldsGadiel Seroussi, Abraham Lempel. jal, 5(3):327-344, 1984.

1983

On the Complexity of Multiplication in Finite FieldsAbraham Lempel, Gadiel Seroussi, Shmuel Winograd. TCS, 22:285-296, 1983.

Maximum likelihood decoding of certain Reed - Muller codesGadiel Seroussi, Abraham Lempel. TIT, 29(3):448, 1983.

1982

A Randomized Protocol for Signing ContractsShimon Even, Oded Goldreich, Abraham Lempel. crypto 1982: 205-210

Maximal families of bent sequencesAbraham Lempel, Martin L. Cohn. TIT, 28(6):865-868, 1982.

Look-ahead coding for input- restricted channelsAbraham Lempel, Martin L. Cohn. TIT, 28(6):933, 1982.

On the power of straight- line computations in finite fieldsAbraham Lempel, Gadiel Seroussi, Jacob Ziv. TIT, 28(6):875-879, 1982.

1980

Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite FieldsGadiel Seroussi, Abraham Lempel. SICOMP, 9(4):758-767, 1980.

1979

Cryptology in TransitionAbraham Lempel. ACM Comput. Surv., 11(4):285-303, 1979.

1978

Compression of Individual Sequences via Variable-Rate CodingJacob Ziv, Abraham Lempel. TIT, 24(5):530-536, 1978.

1977

On fast M-sequence transforms (Corresp.)Martin Cohn, Abraham Lempel. TIT, 23(1):135-137, 1977. [doi]

A new approach to error-correcting codesAbraham Lempel, Shmuel Winograd. TIT, 23(4):503-508, 1977. [doi]

A class of balanced binary sequences with optimal autocorrelation propertiesAbraham Lempel, Martin Cohn, Willard L. Eastman. TIT, 23(1):38-42, 1977. [doi]

A Universal Algorithm for Sequential Data CompressionJacob Ziv, Abraham Lempel. TIT, 23(3):337-343, 1977.

1976

On the Complexity of Finite SequencesAbraham Lempel, Jacob Ziv. TIT, 22(1):75-81, 1976. [doi]

1975

Difference codes with desirable spectral properties (Corresp.)Martin Cohn, Abraham Lempel. TIT, 21(5):593-596, 1975. [doi]

Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2^n)Abraham Lempel. SICOMP, 4(2):175-186, 1975.

1974

On clique-extremal (p, q)-graphsFrank Harary, Abraham Lempel. networks, 4(4):371-378, 1974. [doi]

Families of sequences with optimal Hamming-correlation propertiesAbraham Lempel, Haim Greenberger. TIT, 20(1):90-94, 1974. [doi]

1973

An algorithm for optimal prefix parsing of a noiseless and memoryless channelAbraham Lempel, Shimon Even, Martin Cohn. TIT, 19(2):208-214, 1973. [doi]

1972

Cycle Decomposition by Disjoint TranspositionsMartin Cohn, Abraham Lempel. JCT, 13(1):83-89, 1972.

Permutation Graphs and Transitive GraphsShimon Even, Amir Pnueli, Abraham Lempel. JACM, 19(3):400-410, 1972. [doi]

Generation and Enumeration of All Solutions of the Characteristic Sum ConditionShimon Even, Abraham Lempel. iandc, 21(5):476-482, December 1972.

1971

Analysis and synthesis of polynomials and sequences over GF(2)Abraham Lempel. TIT, 17(3):297-303, 1971. [doi]

High Speed Generation of Maximal Length SequencesAbraham Lempel, Willard L. Eastman. TC, 20(2):227-229, 1971. [doi]

1970

On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift RegistersAbraham Lempel. TC, 19(12):1204-1209, 1970. [doi]

1969

On k-Stable Feedback Shift RegistersAbraham Lempel. TC, 18(7):652-660, 1969. [doi]

Sign in or sign up to see more results.

runs on WebDSL