Several classes of (2m - 1,w,2 optical orthogonal codes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Note: Cyclically permutable representations of cyclic codes
Discrete Applied Mathematics
Shift-invariant protocol sequences for the collision channel without feedback
IEEE Transactions on Information Theory
Constructions of families with unequal auto and cross-correlation constraints
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Double periodic arrays with optimal correlation for applications in watermarking
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Sequences for phase-encoded optical CDMA
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
A general upper bound on the size of constant-weight conflict-avoiding codes
IEEE Transactions on Information Theory
Optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
IEEE Transactions on Information Theory
Construction and applications of CRT sequences
IEEE Transactions on Information Theory
Problems of Information Transmission
New constructions and bounds for 2-d optical orthogonal codes
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Topics on optical orthogonal codes
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Optical orthogonal codes and arcs in PG (d,q)
Finite Fields and Their Applications
| Hi-index | 755.08 |
Three new constructions for families of cyclic constant weight codes are presented. All are asymptotically optimum in the sense that in each case, as the length of the sequences within the family approaches infinity, the ratio of family size to the maximum possible under the Johnson upper bound, approaches unity