New Construction of 2-Generator Quasi-Twisted Codes
| dc.creator | Chen, Eric Z. | |
| dc.date | 2008-05-30 | |
| dc.date.accessioned | 2026-07-07T09:41:53Z | |
| dc.date.available | 2026-07-07T09:41:53Z | |
| dc.description | Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction. | |
| dc.description | 4 pages | |
| dc.identifier | https://arxiv.org/abs/0805.4748 | |
| dc.identifier | http://arxiv.org/abs/0805.4748 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161986 | |
| dc.subject | Information Theory | |
| dc.title | New Construction of 2-Generator Quasi-Twisted Codes | |
| dc.type | text |