𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructions of optimal optical orthogonal codes with weight five

✍ Scribed by Shikui Ma; Yanxun Chang

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
137 KB
Volume
13
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

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 improve the known existence results on optimal OOCs. Especially, we provide an optimal (v, 5, 1)‐OOC for any integer v ≑ 60, 420, 660, 780, 1020, 1140, 1380, 1740 (mod 1800). Β© 2004 Wiley Periodicals, Inc. J Combin Designs 13: 54–69, 2005.

πŸ“œ 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,

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