| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 1456819 (Why is no real title available?)
| 2000-06-07 | Paper |
Match-length functions for data compression
IEEE Transactions on Information Theory | 1996-10-22 | Paper |
scientific article; zbMATH DE number 826060 (Why is no real title available?)
| 1996-08-22 | Paper |
On encoding and decoding with two-way head machines
Information and Computation | 1995-04-10 | Paper |
On ternary complementary sequences
IEEE Transactions on Information Theory | 1994-11-28 | Paper |
scientific article; zbMATH DE number 503199 (Why is no real title available?)
| 1994-02-17 | Paper |
Systematic derivation of spline bases
Computer Aided Geometric Design | 1993-01-18 | Paper |
\(t\)-sum generators of finite Abelian groups
Discrete Mathematics | 1992-12-06 | Paper |
A sequential algorithm for the universal coding of finite memory sources
IEEE Transactions on Information Theory | 1992-09-27 | Paper |
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Application of circulant matrices to the construction and decoding of linear codes
IEEE Transactions on Information Theory | 1992-06-27 | Paper |
Explicit formulas for self-complementary normal bases in certain finite fields
IEEE Transactions on Information Theory | 1992-06-26 | Paper |
Two-dimensional encoding by finite-state encoders
IEEE Transactions on Communications | 1990-01-01 | Paper |
Factorization of symmetric circulant matrices in finite fields
Discrete Applied Mathematics | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4132083 (Why is no real title available?)
| 1990-01-01 | Paper |
On MDS codes via Cauchy matrices
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
A construction of non-Reed-Solomon type MDS codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Self-Complementary Normal Bases in Finite Fields
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Characterization and synthesis of self-complementary normal bases in finite fields
Linear Algebra and its Applications | 1988-01-01 | Paper |
Composition of Reed-Solomon codes and geometric designs
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
On multiset decipherable codes (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network
SIAM Journal on Computing | 1986-01-01 | Paper |
Linear intersecting codes
Discrete Mathematics | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3978974 (Why is no real title available?)
| 1985-01-01 | Paper |
Design of universal test sequences for VLSI
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
Algorithms for the generation of full-length shift- register sequences
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
On symmetric algorithms for bilinear forms over finite fields
Journal of Algorithms | 1984-01-01 | Paper |
Construction of de Bruijn sequences of minimal complexity
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
On the distribution of de Bruijn sequences of given complexity
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3856987 (Why is no real title available?)
| 1983-01-01 | Paper |
On the complexity of multiplication in finite fields
Theoretical Computer Science | 1983-01-01 | Paper |
On Symmetric Representations of Finite Fields
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
Maximum likelihood decoding of certain Reed - Muller codes (Corresp.)
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Maximal families of bent sequences
IEEE Transactions on Information Theory | 1982-01-01 | Paper |
On the power of straight- line computations in finite fields
IEEE Transactions on Information Theory | 1982-01-01 | Paper |
Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
SIAM Journal on Computing | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3693147 (Why is no real title available?)
| 1979-01-01 | Paper |
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
A new approach to error-correcting codes
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
A class of balanced binary sequences with optimal autocorrelation properties
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
Second Order Polynomial Recursions
SIAM Journal on Applied Mathematics | 1977-01-01 | Paper |
On fast M-sequence transforms (Corresp.)
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
On the Complexity of Finite Sequences
IEEE Transactions on Information Theory | 1976-01-01 | Paper |
Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
SIAM Journal on Computing | 1975-01-01 | Paper |
Difference codes with desirable spectral properties (Corresp.)
IEEE Transactions on Information Theory | 1975-01-01 | Paper |
Families of sequences with optimal Hamming-correlation properties
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
On clique-extremal (p,q)-graphs
Networks | 1974-01-01 | Paper |
An algorithm for optimal prefix parsing of a noiseless and memoryless channel
IEEE Transactions on Information Theory | 1973-01-01 | Paper |
Cycle decomposition by disjoint transpositions
Journal of Combinatorial Theory. Series A | 1972-01-01 | Paper |
Permutation Graphs and Transitive Graphs
Journal of the ACM | 1972-01-01 | Paper |
Generation and enumeration of all solutions of the characteristic sum condition
Information and Control | 1972-01-01 | Paper |
Transitive Orientation of Graphs and Identification of Permutation Graphs
Canadian Journal of Mathematics | 1971-01-01 | Paper |
Analysis and synthesis of polynomials and sequences over<tex>GF(2)</tex>
IEEE Transactions on Information Theory | 1971-01-01 | Paper |
m-ary closed sequences
Journal of Combinatorial Theory. Series A | 1971-01-01 | Paper |
On extremal factors of the de Bruijn graph
Journal of Combinatorial Theory. Series B | 1971-01-01 | Paper |
High Speed Generation of Maximal Length Sequences
IEEE Transactions on Computers | 1971-01-01 | Paper |
The Stability of Counting Sequences Under Stage Delays
SIAM Journal on Applied Mathematics | 1971-01-01 | Paper |
On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
IEEE Transactions on Computers | 1970-01-01 | Paper |
scientific article; zbMATH DE number 3385654 (Why is no real title available?)
| 1970-01-01 | Paper |
scientific article; zbMATH DE number 3308132 (Why is no real title available?)
| 1970-01-01 | Paper |
On k-Stable Feedback Shift Registers
IEEE Transactions on Computers | 1969-01-01 | Paper |
scientific article; zbMATH DE number 3304772 (Why is no real title available?)
| 1968-01-01 | Paper |
A Note on Orientation of Graphs
The American Mathematical Monthly | 1968-01-01 | Paper |
scientific article; zbMATH DE number 3315017 (Why is no real title available?)
| 1967-01-01 | Paper |
