Bounds and constructions for optimal variable-weight OOCs with unequal auto-And cross-correlation constraints

Authors

  • Huang, Bichang
  • Wei, Yueer
  • Wu, Dianhua

Abstract

Let W = {W1,...,Wr} be an ordering of a set of r integers greater than 1, a = (λa(1),..., λa(r))) be an r-Tuple of positive integers, λc be a positive integer, and Q = (qi,..., qr) be an r-Tuple of positive rational numbers whose sum is 1. In 1996, Yang introduced variable-weight optical orthogonal code ((n, W, a, λc, Q)-OOC) for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. Most existing works on variable-weight optical orthogonal codes assume that λa(1)...,λa(r) = λc = 1. In this paper, we focus our attention on (n, {3,4}, λa, l,Q)-OOCs, where a ϵ {(1,2), (2,1),(2,2)}. Tight upper bounds on the maximum code size of (n, {3,4}, a 1, Q)-OOCs are obtained, and four infinite classes of optimal (n, {3,4}, a,1, Q)-OOCs are constructed. © 2015 Utilitas Mathematics.

Published

2017-06-09

How to Cite

Huang, Bichang, Wei, Yueer, & Wu, Dianhua. (2017). Bounds and constructions for optimal variable-weight OOCs with unequal auto-And cross-correlation constraints. Utilitas Mathematica, 103. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1217

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.