Sammanfattning
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound on the minimum distance, is also constructed.
| Originalspråk | Engelska |
|---|---|
| Sidor | 74-81 |
| Antal sidor | 7 |
| Status | Publicerad - 2005 |
| Evenemang | Sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria, June 16 - 22, 2009 - Varaktighet: 1980-jan.-01 → … |
Konferens
| Konferens | Sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria, June 16 - 22, 2009 |
|---|---|
| Period | 80-01-01 → … |
Nationell ämneskategori
- Datavetenskap (10201)