An Explicit Construction of 2-Generator Quasi-Twisted Codes
From MaRDI portal
Publication:3604965
DOI10.1109/TIT.2008.2006430zbMATH Open1318.94091arXiv0805.4748MaRDI QIDQ3604965FDOQ3604965
Authors: Eric Z. Chen 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/0805.4748
Recommendations
Cited In (12)
- Quantum codes and entanglement-assisted quantum codes derived from one-generator quasi-twisted codes
- New quinary linear codes from quasi-twisted codes and their duals
- On complementary dual quasi-twisted codes
- An infinite family of Griesmer quasi-cyclic self-orthogonal codes
- The homogeneous weight for Rk, related gray map and new binary quasi-cyclic codes
- A generalization of quasi-twisted codes: multi-twisted codes
- Quasi-twisted codes achieving the Gilbert-Varshamov bound
- The structure of 1-generator quasi-twisted codes and new linear codes
- Matrix product and quasi-twisted codes in one class
- Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields
- New 1-generator quasi-twisted codes over GF(5)
- Quasi-twisted codes as contractions of quasi-cyclic codes
This page was built for publication: An Explicit Construction of $2$-Generator Quasi-Twisted Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604965)
