Abraham Lempel

IEEE Trans. Inf. Theory, 1996

1995

On Encoding and Decoding with Two-Way Head Machines

[BibT_eX]

[DOI]

Dafna Sheinwald

Inf. Comput., January, 1995

1994

On ternary complementary sequences.

[BibT_eX]

[DOI]

Amnon Gavish

IEEE Trans. Inf. Theory, 1994

1993

On Complementary Sequences.

[BibT_eX]

[DOI]

Amnon Gavish

Proceedings of the Algebraic Coding, 1993

Application of Finte Fields to Memory Interleaving.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1992

A sequential algorithm for the universal coding of finite memory sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

t-sum generators of finite Abelian groups.

[BibT_eX]

[DOI]

Discret. Math., 1992

Systematic derivation of spline bases.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 1992

On the Coding Delay of a General Coder.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1992

1991

Explicit formulas for self-complementary normal bases in certain finite fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1991

On Compression with Two-Way Head Machines.

[BibT_eX]

[DOI]

Dafna Sheinwald

Proceedings of the IEEE Data Compression Conference, 1991

1990

Application of circulant matrices to the construction and decoding of linear codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

Two-dimensional encoding by finite-state encoders.

[BibT_eX]

[DOI]

Dafna Sheinwald

IEEE Trans. Commun., 1990

Factorization of symmetric circulant matrices in finite fields.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

1989

On MDS codes via Cauchy matrices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

A construction of non-Reed-Solomon type MDS codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

1988

Composition of Reed-Solomon codes and geometric designs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

Self-Complementary Normal Bases in Finite Fields.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

1986

Compression of two-dimensional data.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

On multiset decipherable codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

1985

Design of universal test sequences for VLSI.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

Linear intersecting codes.

[BibT_eX]

[DOI]

Gérard D. Cohen

Discret. Math., 1985

1984

Construction of de Bruijn sequences of minimal complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

On the distribution of de Bruijn sequences of given complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

Algorithms for the generation of full-length shift-register sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

On Symmetric Algorithms for Bilinear Forms over Finite Fields.

[BibT_eX]

[DOI]

J. Algorithms, 1984

1983

Maximum likelihood decoding of certain Reed - Muller codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

On the Complexity of Multiplication in Finite Fields.

[BibT_eX]

[DOI]

Shmuel Winograd

Theor. Comput. Sci., 1983

1982

On the power of straight- line computations in finite fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

Look-ahead coding for input- restricted channels.

[BibT_eX]

[DOI]

Martin L. Cohn

IEEE Trans. Inf. Theory, 1982

Maximal families of bent sequences.

[BibT_eX]

[DOI]

Martin L. Cohn

IEEE Trans. Inf. Theory, 1982

A Randomized Protocol for Signing Contracts.

[BibT_eX]

[DOI]

Oded Goldreich

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1980

Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

1979

Cryptology in Transition.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1979

1978

Compression of individual sequences via variable-rate coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1978

1977

A universal algorithm for sequential data compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1977

A new approach to error-correcting codes.

[BibT_eX]

[DOI]

Shmuel Winograd

IEEE Trans. Inf. Theory, 1977

A class of balanced binary sequences with optimal autocorrelation properties.

[BibT_eX]

[DOI]

Willard L. Eastman

IEEE Trans. Inf. Theory, 1977

On fast M-sequence transforms (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1977

1976

On the Complexity of Finite Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1976

1975

Difference codes with desirable spectral properties (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1975

Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2<sup>n</sup>).

[BibT_eX]

[DOI]

SIAM J. Comput., 1975

1974

Families of sequences with optimal Hamming-correlation properties.

[BibT_eX]

[DOI]

Haim Greenberger

IEEE Trans. Inf. Theory, 1974

On clique-extremal (p, q)-graphs.

[BibT_eX]

[DOI]

Frank Harary

Networks, 1974

1973

An algorithm for optimal prefix parsing of a noiseless and memoryless channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1973

1972

Generation and Enumeration of All Solutions of the Characteristic Sum Condition

[BibT_eX]

[DOI]

Inf. Control., December, 1972

Cycle Decomposition by Disjoint Transpositions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1972

Permutation Graphs and Transitive Graphs.

[BibT_eX]

[DOI]

Amir Pnueli

J. ACM, 1972

1971

Analysis and synthesis of polynomials and sequences over GF(2).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1971

High Speed Generation of Maximal Length Sequences.

[BibT_eX]

[DOI]

Willard L. Eastman

IEEE Trans. Computers, 1971

1970

On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1970

1969

On k-Stable Feedback Shift Registers.

[BibT_eX]

[DOI]