Sammanfattning
Based on cyclic simplex codes, a new construction of a family of two-weight codes is given. These two-weight codes are in a simple 2-generator quasi-cyclic form. Based on this construction, new optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208, 6, 135], [221, 6, 144] codes are thus obtained. It was also shown that some codes that meet the Griesmer bound and thus are optimal. Furthermre, binary self-complementary codes in a 3-generator quasi-cyclic form, are also constructed.
| Originalspråk | Engelska |
|---|---|
| Sidor | 2191-2195 |
| Antal sidor | 4 |
| Status | Publicerad - 2007 |
| Evenemang | 2007 IEEE International Symposium on Information Theory, Nice, France, 24-29 June 2007 - Varaktighet: 1980-jan.-01 → … |
Konferens
| Konferens | 2007 IEEE International Symposium on Information Theory, Nice, France, 24-29 June 2007 |
|---|---|
| Period | 80-01-01 → … |
Nationell ämneskategori
- Datavetenskap (10201)