Direct constructions of additive codes
✍ Scribed by Jürgen Bierbrauer
- Book ID
- 102307472
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 117 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A code is q^m^‐ary q‐linear if its alphabet forms an m‐dimensional vector space over 𝔽~q~ and the code is linear over 𝔽~q~. These additive codes form a natural generalization of linear codes. Our main results are direct constructions of certain families of additive codes. These comprise the additive generalization of the Kasami codes, an additive generalization of the Bose‐Bush construction of orthogonal arrays of strength 2 as well as a class of additive codes which are being used for deep space communication. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 207–216, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.20000
📜 SIMILAR VOLUMES
We continue here the research on (quasi)group codes over (quasi)group rings. We give some constructions of [n, n -3, 3] qcodes over F q for n = 2q and n = 3q. These codes are linearly optimal, i.e. have maximal dimension among linear codes having a given length and distance. Although codes with such
## 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,