Abstract
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.
| Original language | English |
|---|---|
| Pages | 2191-2195 |
| Number of pages | 4 |
| Publication status | Published - 2007 |
| Event | 2007 IEEE International Symposium on Information Theory, Nice, France, 24-29 June 2007 - Duration: 1980-Jan-01 → … |
Conference
| Conference | 2007 IEEE International Symposium on Information Theory, Nice, France, 24-29 June 2007 |
|---|---|
| Period | 80-01-01 → … |
Swedish Standard Keywords
- Computer Sciences (10201)
Keywords
- codes and coding
- quasi-cyclic codes
- simplex codes
Fingerprint
Dive into the research topics of 'New constructions of a family of 2-generator quasi-cyclic two-weight codes and related codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver