Sammanfattning
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this paper, 2-generator QC codes are studied, and many good 2-generator QC codes are constructed using simplex codes. A computer algorithm is given, and used to find the best possible 2-generator QC codes. Among those 2-generator QC codes constructed, some codes are two-weight codes.
| Originalspråk | Engelska |
|---|---|
| Sidor | 56-59 |
| Antal sidor | 3 |
| Status | Publicerad - 2006 |
| Evenemang | Tenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10), Zvenigorod, Russia, September 2006 - Varaktighet: 1980-jan.-01 → … |
Konferens
| Konferens | Tenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10), Zvenigorod, Russia, September 2006 |
|---|---|
| Period | 80-01-01 → … |
Nationell ämneskategori
- Datavetenskap (10201)