Construction of quasi-twisted codes and enumeration of defining polynomials
Construction of quasi-twisted codes and enumeration of defining polynomials
| dc.contributor.author | Gulliver, T. Aaron | |
| dc.contributor.author | Venkaiah, Vadlamudi Ch | |
| dc.date.accessioned | 2022-03-27T05:51:01Z | |
| dc.date.available | 2022-03-27T05:51:01Z | |
| dc.date.issued | 2020-01-01 | |
| dc.description.abstract | Let dq(n, k) be the maximum possible minimum Hamming distance of a linear [n, k] code over Fq. Tables of best known linear codes exist for small fields and some results are known for larger fields. Quasi-twisted codes are constructed using m × m twistulant matrices and many of these are the best known codes. In this paper, the number of m × m twistulant matrices over Fq is enumerated and linear codes over F17 and F19 are constructed for k up to 5. | |
| dc.identifier.citation | Journal of Algebra Combinatorics Discrete Structures and Applications. v.7(1 Special Issue) | |
| dc.identifier.uri | 10.13069/jacodesmath.645015 | |
| dc.identifier.uri | https://dergipark.org.tr/en/doi/10.13069/jacodesmath.645015 | |
| dc.identifier.uri | https://dspace.uohyd.ac.in/handle/1/8306 | |
| dc.subject | Finite fields | |
| dc.subject | Griesmer bound | |
| dc.subject | Optimal codes | |
| dc.subject | Quasi-twisted codes | |
| dc.subject | Twistulant matrices | |
| dc.title | Construction of quasi-twisted codes and enumeration of defining polynomials | |
| dc.type | Journal. Article | |
| dspace.entity.type |
Files
License bundle
1 - 1 of 1