1996
Match-length functions for data compression.
IEEE Trans. Inf. Theory, 1996
1995
On Encoding and Decoding with Two-Way Head Machines
Inf. Comput., January, 1995
1994
On ternary complementary sequences.
IEEE Trans. Inf. Theory, 1994
1993
On Complementary Sequences.
Proceedings of the Algebraic Coding, 1993
Application of Finte Fields to Memory Interleaving.
Proceedings of the Applied Algebra, 1993
1992
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences.
IEEE Trans. Inf. Theory, 1992
A sequential algorithm for the universal coding of finite memory sources.
IEEE Trans. Inf. Theory, 1992
t-sum generators of finite Abelian groups.
Discret. Math., 1992
Systematic derivation of spline bases.
Comput. Aided Geom. Des., 1992
On the Coding Delay of a General Coder.
Proceedings of the IEEE Data Compression Conference, 1992
1991
Explicit formulas for self-complementary normal bases in certain finite fields.
IEEE Trans. Inf. Theory, 1991
On Compression with Two-Way Head Machines.
Proceedings of the IEEE Data Compression Conference, 1991
1990
Application of circulant matrices to the construction and decoding of linear codes.
IEEE Trans. Inf. Theory, 1990
Two-dimensional encoding by finite-state encoders.
IEEE Trans. Commun., 1990
Factorization of symmetric circulant matrices in finite fields.
Discret. Appl. Math., 1990
1989
On MDS codes via Cauchy matrices.
IEEE Trans. Inf. Theory, 1989
A construction of non-Reed-Solomon type MDS codes.
IEEE Trans. Inf. Theory, 1989
1988
Composition of Reed-Solomon codes and geometric designs.
IEEE Trans. Inf. Theory, 1988
Self-Complementary Normal Bases in Finite Fields.
SIAM J. Discret. Math., 1988
1986
Compression of two-dimensional data.
IEEE Trans. Inf. Theory, 1986
On multiset decipherable codes.
IEEE Trans. Inf. Theory, 1986
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network.
SIAM J. Comput., 1986
1985
Design of universal test sequences for VLSI.
IEEE Trans. Inf. Theory, 1985
Linear intersecting codes.
Discret. Math., 1985
A Randomized Protocol for Signing Contracts.
Commun. ACM, 1985
1984
Construction of de Bruijn sequences of minimal complexity.
IEEE Trans. Inf. Theory, 1984
On the distribution of de Bruijn sequences of given complexity.
IEEE Trans. Inf. Theory, 1984
Algorithms for the generation of full-length shift-register sequences.
IEEE Trans. Inf. Theory, 1984
On Symmetric Algorithms for Bilinear Forms over Finite Fields.
J. Algorithms, 1984
1983
Maximum likelihood decoding of certain Reed - Muller codes.
IEEE Trans. Inf. Theory, 1983
On the Complexity of Multiplication in Finite Fields.
Theor. Comput. Sci., 1983
1982
On the power of straight- line computations in finite fields.
IEEE Trans. Inf. Theory, 1982
Look-ahead coding for input- restricted channels.
IEEE Trans. Inf. Theory, 1982
Maximal families of bent sequences.
IEEE Trans. Inf. Theory, 1982
1980
Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields.
SIAM J. Comput., 1980
1979
Cryptology in Transition.
ACM Comput. Surv., 1979
1978
Compression of individual sequences via variable-rate coding.
IEEE Trans. Inf. Theory, 1978
1977
A universal algorithm for sequential data compression.
IEEE Trans. Inf. Theory, 1977
A new approach to error-correcting codes.
IEEE Trans. Inf. Theory, 1977
A class of balanced binary sequences with optimal autocorrelation properties.
IEEE Trans. Inf. Theory, 1977
On fast M-sequence transforms (Corresp.).
IEEE Trans. Inf. Theory, 1977
1976
On the Complexity of Finite Sequences.
IEEE Trans. Inf. Theory, 1976
1975
Difference codes with desirable spectral properties (Corresp.).
IEEE Trans. Inf. Theory, 1975
Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2<sup>n</sup>).
SIAM J. Comput., 1975
1974
Families of sequences with optimal Hamming-correlation properties.
IEEE Trans. Inf. Theory, 1974
On clique-extremal (p, q)-graphs.
Networks, 1974
1973
An algorithm for optimal prefix parsing of a noiseless and memoryless channel.
IEEE Trans. Inf. Theory, 1973
1972
Generation and Enumeration of All Solutions of the Characteristic Sum Condition
Inf. Control., December, 1972
Cycle Decomposition by Disjoint Transpositions.
J. Comb. Theory A, 1972
Permutation Graphs and Transitive Graphs.
J. ACM, 1972
1971
Analysis and synthesis of polynomials and sequences over GF(2).
IEEE Trans. Inf. Theory, 1971
High Speed Generation of Maximal Length Sequences.
IEEE Trans. Computers, 1971
1970
On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers.
IEEE Trans. Computers, 1970
1969
On k-Stable Feedback Shift Registers.
IEEE Trans. Computers, 1969
