## 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 additi
Direct construction of code loops
✍ Scribed by Gábor P. Nagy
- Book ID
- 108113930
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 302 KB
- Volume
- 308
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Numerous computational examples suggest that if 9"(, k 1 C 9Z k arc (k 1)-and k-nets of order n, then rankp 0Z~ -rankp 9Zk\_ I \_> n -k + 1 ~br any prime p dividing n at most once. We conjecture that this inequality always holds. Using characters of loops, we verify the conjecture in case k = 3, pro
This paper will focus on the construction of superimposed codes using incidence matrices. Such constructions require a set of elements and a partial order defined on the set. We will define a partial order on partitions. The construction will be made using elements from the partially ordered set of