𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructions of optimal variable-weight optical orthogonal codes

✍ Scribed by Hengming Zhao; Dianhua Wu; Pingzhi Fan

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
165 KB
Volume
18
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

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, 6}. Β© 2010 Wiley Periodicals, Inc. J Combin Designs 18: 274–291, 2010

πŸ“œ SIMILAR VOLUMES

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

Optimal (4up, 5, 1) optical orthogonal c
Optimal (4up, 5, 1) optical orthogonal codes
✍ Yanxun Chang; L. Ji πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

## Abstract By a (__Ξ½__, __k__, 1)‐OOC we mean an optical orthogonal code. In this paper, it is proved that an optimal (4__p__, 5, 1)‐OOC exists for prime __p__ ≑ 1 (mod 10), and that an optimal (4__up__, 5, 1)‐OOC exists for __u__ = 2, 3 and prime __p__ ≑ 11 (mod 20). These results are obtained by

Optimal (v, 4, 2, 1) optical orthogonal
Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters
✍ Tsonka Baicheva; Svetlana Topalova πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 166 KB

## Abstract Optimal **(__v__, 4,2,1)** optical orthogonal codes (OOCs) with **__v__**β©½**75** and **__v__**β‰ **71** are classified up to isomorphism. One **(__v__, 4,2,1)** OOC is presented for all **__v__**β©½**181**, for which an optimal OOC exists. Copyright Β© 2011 Wiley Periodicals, Inc. J Combin D

The optimality of Feng–Rao designed mini
The optimality of Feng–Rao designed minimum distance for Hermitian codes constructed by weight order based on pole order
✍ Daisuke Umehara; Shinji Miura; Tomohiko Uyematsu; Eiji Okamoto πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 313 KB πŸ‘ 2 views

The algebraic geometric code is known as a linear code that guarantees a relatively large minimum distance under the condition that the number of check symbols is kept constant, when the code length is long. Recently, Saints and Heegard presented a unified theory for decoding of the algebraic geomet