✦ LIBER ✦

Optimal doubly constant weight codes

✍ Scribed by Tuvi Etzion

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 163 KB
Volume: 16
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20160

No coin nor oath required. For personal study only.

✦ Synopsis

A doubly constant weight code is a binary code of length n 1 + n 2 , with constant weight w 1 + w 2 , such that the weight of a codeword in the first n 1 coordinates is w 1 . Such codes have applications in obtaining bounds on the sizes of constant weight codes with given minimum distance. Lower and upper bounds on the sizes of such codes are derived. In particular, we show tight connections between optimal codes and some known designs such as Howell designs, Kirkman squares, orthogonal arrays, Steiner systems, and large sets of Steiner systems. These optimal codes are natural generalization of Steiner systems and they are also called doubly Steiner systems.

📜 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

Optimal transform coding for speech line

Optimal transform coding for speech line spectrum pair parameters based on spectral-weighted error criterion

✍ Fu-Rong Jean; Chih-Chung Kuo; Hsiao-Chuan Wang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 478 KB

The line spectrum pair (LSP) is one of the most popular and efficient parameters for representing the short-time spectrum of speech signal. About 34 bits/frame is needed for direct scalar quantization of LSP parameters to maintain a good quality. Based on the spectralweighted Euclidean distance of L

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