A survey on relative difference sets
GDSTM '93 Proceedings of a special research quarter on Groups, difference sets, and the monster
Finite fields
Generators and irreducible polynomials over finite fields
Mathematics of Computation
Construction for optimal optical orthogonal codes
Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Constructions of Optical Orthogonal Codes from Finite Geometry
SIAM Journal on Discrete Mathematics
Constructions for strictly cyclic 3-designs and applications to optimal OOCs with λ=2
Journal of Combinatorial Theory Series A
Further progress on difference families with block size 4 or 5
Designs, Codes and Cryptography
Optical orthogonal codes: design, analysis and applications
IEEE Transactions on Information Theory
Optical orthogonal codes: their bounds and new optimal constructions
IEEE Transactions on Information Theory
Optical orthogonal codes-new bounds and an optimal construction
IEEE Transactions on Information Theory
Constructions for optimal (υ, 4, 1) optical orthogonal codes
IEEE Transactions on Information Theory
Combinatorial constructions of optimal optical orthogonal codes with weight 4
IEEE Transactions on Information Theory
A new recursive construction for optical orthogonal codes
IEEE Transactions on Information Theory
A Generalized Bose-Chowla Family of Optical Orthogonal Codes and Distinct Difference Sets
IEEE Transactions on Information Theory
Optical orthogonal codes and arcs in PG (d,q)
Finite Fields and Their Applications
Optical orthogonal codes obtained from conics on finite projective planes
Finite Fields and Their Applications
| Hi-index | 0.00 |
In this paper, we discuss about restrictions of optical orthogonal codes (OOC) to subgroups and obtain variable weight OOCs in which the weight of each codeword is lower and upper bounded in relation to a character sum over finite fields. We show that the following three new series of optimal or asymptotically optimal constant weight OOCs are included in those variable weight ones: (i) an optimal (q^2-1e,@?q-(e-1)qe@?,1)-OOC with e codewords; (ii) an optimal (q^2+q+1e,@?q+1-(e-1)qe@?,1)-OOC with e codewords; and (iii) an asymptotically optimal (q^2-1e,@?q-3(e-1)qe@?,2)-OOC with e(q-1) codewords.