New results on optimal (v, 4, 2, 1) optical orthogonal codes
- 27 March 2010
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 58 (1) , 89-109
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Further progress on difference families with block size 4 or 5Designs, Codes and Cryptography, 2009
- Combinatorial designs and the theorem of Weil on multiplicative character sumsFinite Fields and Their Applications, 2009
- Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal CodesIEEE Transactions on Information Theory, 2009
- Strong difference families, difference covers, and their applications for relative difference familiesDesigns, Codes and Cryptography, 2008
- Families of Optimal OOCs With $\lambda = 2$IEEE Transactions on Information Theory, 2008
- Geometric constructions of optimal optical orthogonal codesAdvances in Mathematics of Communications, 2008
- Constructions of optimal optical orthogonal codes with weight fiveJournal of Combinatorial Designs, 2004
- Some progress on (v,4,1) difference families and optical orthogonal codesJournal of Combinatorial Theory, Series A, 2004
- Recursive constructions for optimal (n,4,2)‐OOCsJournal of Combinatorial Designs, 2004
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNSAnnals of Eugenics, 1939