𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Variable-Weight Optical Orthogonal Codes via Difference Packings

✍ Scribed by Dianhua Wu; Hengming Zhao; Pingzhi Fan; Shinohara, S.

Book ID
114642219
Publisher
IEEE
Year
2010
Tongue
English
Weight
214 KB
Volume
56
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constructions of optimal variable-weight
Constructions of optimal variable-weight optical orthogonal codes
✍ Hengming Zhao; Dianhua Wu; Pingzhi Fan πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

## Abstract Variable‐weight optical orthogonal code (OOC) was introduced by G‐C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this article, new infinite classes of optimal (__u, W__, 1, {1/2, 1/2})‐OOCs are obtained for __W__={3, 4}, {3, 5} and {3,

Constructions of optimal optical orthogo
Constructions of optimal optical orthogonal codes with weight five
✍ Shikui Ma; Yanxun Chang πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 137 KB

## Abstract Several direct constructions via skew starters and Weil's theorem on character sum estimates are given in this paper for optimal (__gv__, 5, 1) optical orthogonal codes (OOCs) where 60 ≀ __g__ ≀ 180 satisfying __g__ ≑ 0 (mod 20) and __v__ is a product of primes greater than 5. These imp

Further results on optimal optical ortho
Further results on optimal optical orthogonal codes with weight 4
✍ Yanxun Chang; Jianxing Yin πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 276 KB

By a (v; k; 1)-OOC we mean an optical orthogonal code of length v, weight k, and correlation constraints 1. In this paper, we take advantage of the equivalence between such codes and cyclic packings of pairs to make further investigation regarding the existence of a (v; 4; 1)-OOC. It is proved that