Some combinational constructions for optical orthogonal codes
Discrete Mathematics
Pairwise balanced designs from finite fields
Discrete Mathematics
Optimal (9v, 4, 1) Optical Orthogonal Codes
SIAM Journal on Discrete Mathematics
Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes
Designs, Codes and Cryptography
Construction for optimal optical orthogonal codes
Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Some progress on (v, 4, 1) difference families and optical orthogonal codes
Journal of Combinatorial Theory Series A
Optimal variable-weight optical orthogonal codes via cyclic difference families
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Optical orthogonal codes: their bounds and new optimal constructions
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 new class of optimal optical orthogonal codes with weight five
IEEE Transactions on Information Theory
Constructions for optimal constant weight cyclically permutable codes and difference families
IEEE Transactions on Information Theory
Variable weight sequences for adaptive scheduled access in MANETs
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Hi-index | 0.00 |
Let W, L, and Q denote the sets {w0, w1, ..., wp}, {λa0, λa1, ..., λap} and {q0, q1, ..., qp}, respectively. An (n, W, L, λc, Q) variable-weight optical orthogonal code C, or (n, W, L, λc, Q)-OOC, is a collection of binary n-tuples such that for each 0 ≤ i ≤ p, there are exactly qi|C| codewords of weight wi, L is related to periodic auto-correlation, and λc is related to periodic cross-correlation. The notation (n, W, L, λ, Q)- OOC is used to denote an (n, W, L, λc, Q)-OOC with the property that λa0 = λa1 = ... = λap = λc = λ. An (n, W, L, λc, Q)-OOCs was introduced by Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. A cyclic (v, K, 1) difference family (cyclic (v, K, λ)-DF in short) is a family F = {B1, B2, ..., Bt} of t subsets of Zv, the residue ring of integers modulo v, K = {|Bi| : 1 ≤ i ≤ t}, such that the differences in F, ΔF = ∪B∈F ΔB cover each nonzero element of Zv exactly λ times, where for each B ∈ F, ΔB = {x - y : x, y ∈ B, x ≠ y}, and |dev Bi| = v, 1 ≤ i ≤ t, dev Bi = {Bi + g : g ∈ Zv}. A cyclic (v, W, 1, Q)-DF is defined to be a cyclic (v, W, 1)-DF with the property that the fraction of number of blocks of size wi is qi, 0 ≤ i ≤ p. In this paper, constructions for cyclic (v, {4, 6, 7}, 1, {1/3, 1/3, 1/3})-DFs for primes v ≡ 1 (mod 84), (v, {4, u}, 1, {1/2, 1/2})-DFs for primes v ≡ 1 (mod u(u-1) + 12), u ≡ 0, 1 (mod 3) 4 are presented. New optimal (v, W, 1, Q)-OOCs for 2 ≤ |W| ≤ 4 are then obtained.