Abstract
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.
| Original language | English |
|---|---|
| Pages | 74-81 |
| Number of pages | 7 |
| Publication status | Published - 2005 |
| Event | Sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria, June 16 - 22, 2009 - Duration: 1980-Jan-01 → … |
Conference
| Conference | Sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria, June 16 - 22, 2009 |
|---|---|
| Period | 80-01-01 → … |
Swedish Standard Keywords
- Computer Sciences (10201)
Keywords
- codes and coding
- cyclic codes
- idempotent
- irreducible codes
- linear codes
- quasi-cyclic codes