| Publication | Date of Publication | Type |
|---|
On a conjecture on Reed-Muller codes
International Journal of Electronics | 2023-12-11 | Paper |
Seeds for Generalized Taxicab Numbers
(available as arXiv preprint) | 2019-05-20 | Paper |
| Seeds for Generalized Taxicab Numbers | 2019-05-20 | Paper |
| scientific article; zbMATH DE number 1498331 (Why is no real title available?) | 2000-08-30 | Paper |
| scientific article; zbMATH DE number 1394287 (Why is no real title available?) | 2000-01-27 | Paper |
Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols
IEEE Transactions on Information Theory | 1994-09-27 | Paper |
| scientific article; zbMATH DE number 4191555 (Why is no real title available?) | 1990-01-01 | Paper |
On the linear span of binary sequences obtained from q-ary m-sequences, q odd
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
On the quadratic spans of DeBruijn sequences
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4039793 (Why is no real title available?) | 1987-01-01 | Paper |
An Algebraic Construction of Sonar Sequences Using <i>M</i>-Sequences
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
The geometry of quadrics and correlations of sequences (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
The Geometry of <i>m</i>-Sequences: Three-Valued Crosscorrelations and Quadrics in Finite Projective Geometry
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
Optimal book embeddings of the FFT, Benes, and barrel shifter networks
Algorithmica | 1986-01-01 | Paper |
An algorithm for complex approximations in&lt;tex&gt;Z[e^{2{pi}i/8}]&lt;/tex&gt;(Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial
Discrete Applied Mathematics | 1985-01-01 | Paper |
Complex approximations using algebraic integers
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
A fast algorithm for determining the complexity of a binary sequence with period&lt;tex&gt;2^n&lt;/tex&gt;(Corresp.)
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
The packing problem for projective geometries over GF(3) with dimension greater than five
Journal of Combinatorial Theory. Series A | 1983-01-01 | Paper |
There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)
Journal of Combinatorial Theory. Series A | 1983-01-01 | Paper |
A generalized recursive construction for de Bruijn sequences
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
On the Complexities of Periodic Sequences
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
On the complexities of de-Bruijn sequences
Journal of Combinatorial Theory. Series A | 1982-01-01 | Paper |
