Construction of Quasi-Twisted Codes and Enumeration of Defining Polynomials

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Aaron Gulliver¹  Vadlamudi Ch. Venkaiah² 

[1] Department of Electrical and Computer Engineering, University ofVictoria;School of Computer and Information Sciences, University of Hyderabad

关键词: Finite fields;    Twistulant matrices;    Quasi-twisted codes;    Optimal codes;    Griesmer bound;   

DOI  :  10.13069/jacodesmath.645015

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

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 bestknown codes. In this paper, the number of m × m twistulant matrices over Fq is enumerated andlinear codes over F17 and F19 are constructed for k up to 5.

【 授权许可】

CC BY