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
β¦ LIBER β¦
Nets and their codes
β Scribed by Steven Dougherty
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 894 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0925-1022
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Bruck nets, codes, and characters of loo
β
G. Eric Moorhouse
π
Article
π
1991
π
Springer
π
English
β 846 KB
Families of Ternary-Nets Related to BCH-
β
Yves Edel; JΓΌrgen Bierbrauer
π
Article
π
2001
π
Springer Vienna
π
English
β 63 KB
Crystallographic nets and their quotient
β
W. E. Klee
π
Article
π
2004
π
John Wiley and Sons
π
English
β 151 KB
Generalized product codes and their perf
β
Toshifumi Hatamori; Masao Kasahara
π
Article
π
1994
π
John Wiley and Sons
π
English
β 618 KB
Symmetry codes and their invariant subco
β
Vera Pless
π
Article
π
1975
π
Elsevier Science
π
English
β 484 KB
New quinary linear codes from quasi-twis
β
Ryan Ackerman; Nuh Aydin
π
Article
π
2011
π
Elsevier Science
π
English
β 219 KB
One of the central problems in algebraic coding theory is construction of linear codes with best possible parameters. Quasi-twisted (QT) codes have been promising to solve this problem. Despite extensive search in this class and discovery of a large number of new codes, we have been able to find sti