| Publication | Date of Publication | Type |
|---|
New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On the Sidel'nikov Sequences as Frequency-Hopping Sequences
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
New $M$-Ary Sequence Families With Low Correlation and Large Size
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On the Cross-Correlation Distributions of $M$-ary Multiplicative Character Sequences
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Optimal Frequency-Hopping Sequences With New Parameters
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
$k$-Fold Cyclotomy and Its Application to Frequency-Hopping Sequences
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
A New Class of Balanced Near-Perfect Nonlinear Mappings and Its Application to Sequence Design
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
New Classes of Optimal Low-Hit-Zone Frequency-Hopping Sequence Sets by Cartesian Product
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Asymptotically Optimal Optical Orthogonal Codes With New Parameters
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
New Families of Optimal Frequency-Hopping Sequences of Composite Lengths
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Partial-Period Correlations of Zadoff–Chu Sequences and Their Relatives
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
New Families of Optimal Variable-Weight Optical Orthogonal Codes With High Weights
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
The exponent of a polarizing matrix constructed from the Kronecker product
Designs, Codes and Cryptography | 2014-03-17 | Paper |
Low-hit-zone frequency-hopping sequence sets with new parameters
Lecture Notes in Computer Science | 2012-09-07 | Paper |
New families of frequency-hopping sequences of length \(mN\) derived from the \(k\)-fold cyclotomy
Sequences and Their Applications – SETA 2010 | 2010-09-08 | Paper |
New Design of Quaternary Low-Correlation Zone Sequence Sets and Quaternary Hadamard Matrices
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Design of M-Ary Low Correlation Zone Sequence Sets by Interleaving
Sequences and Their Applications - SETA 2008 | 2009-02-10 | Paper |
On the minimum distance of array codes as LDPC codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Quasi-Cyclic LDPC Codes for Fast Encoding
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Weighted Nonbinary Repeat–Accumulate Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
Sequences and Their Applications – SETA 2006 | 2008-11-27 | Paper |
Autocorrelation Properties of Resilient Functions and Three-Valued Almost-Optimal Functions Satisfying PC(p)
Sequences and Their Applications - SETA 2004 | 2008-03-14 | Paper |
| scientific article; zbMATH DE number 1972842 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1950614 (Why is no real title available?) | 2003-07-17 | Paper |
On \(t\)-designs from codes over \(\mathbb{Z}_4\)
Discrete Mathematics | 2002-11-12 | Paper |
New construction for binary sequences of period p/sup m/-1 with optimal autocorrelation using (z+1)/sup d/+az/sup d/+b
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
New 3-designs from Goethals codes over \(Z_4\)
Discrete Mathematics | 2001-04-20 | Paper |
Split weight enumerators for the Preparata codes with applications to designs
Designs, Codes and Cryptography | 2001-01-01 | Paper |
Quasi-orthogonal sequences for code-division multiple-access systems
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
New infinite families of 3-designs from Preparata codes over \(\mathbb{Z}_4\)
Discrete Mathematics | 2000-05-08 | Paper |
Further results on generalized Hamming weights for Goethals and Preparata codes over Z/sub 4/
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
An infinite family of 3-designs from Preparata codes over \(\mathbb{Z}_4\)
Designs, Codes and Cryptography | 1999-08-22 | Paper |
On the weight hierarchy of Preparata codes over Z/sub 4/
IEEE Transactions on Information Theory | 1999-04-20 | Paper |
On the weight hierarchy of Goethals codes over Z/sub 4/
IEEE Transactions on Information Theory | 1999-04-20 | Paper |
New construction for families of binary sequences with optimal correlation properties
IEEE Transactions on Information Theory | 1998-06-11 | Paper |
Two new infinite families of 3-designs from Kerdock codes over \(\mathbb Z_4\).
Designs, Codes and Cryptography | 1998-01-01 | Paper |
Trace representation of Legendre sequences of Mersenne prime period
IEEE Transactions on Information Theory | 1997-10-20 | Paper |
On the weight hierarchy of Kerdock codes over Z/sub 4/
IEEE Transactions on Information Theory | 1996-10-22 | Paper |
On the weight hierarchy of geometric Goppa codes
IEEE Transactions on Information Theory | 1995-09-25 | Paper |
On the generalized Hamming weights of product codes
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
| scientific article; zbMATH DE number 125903 (Why is no real title available?) | 1993-02-21 | Paper |
