New QC Codes over GF(11)

被引：0
|
作者：
Daskalov, Rumen [1 ]
Metodieva, Elena [1 ]
机构：
[1] Tech Univ Gabrovo, Dept Math & Informat, Gabrovo 5300, Bulgaria
来源：
PROCEEDINGS OF THE 2020 SEVENTEENTH INTERNATIONAL WORKSHOP ON ALGEBRAIC AND COMBINATORIAL CODING THEORY ALGEBRAIC AND COMBINATORIAL CODING THEORY (ACCT 2020): PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL WORKSHOP ON ALGEBRAIC AND COMBINATORIAL CODING THEORY ACCT 2020 | 2020年
关键词：
Finite field; linear codes; cyclic codes; QC codes; QUASI-TWISTED CODES; MINIMUM DISTANCE; NONEXISTENCE; BOUNDS;
D O I：
10.1109/ACCT51235.2020.9383337
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A linear code of length n, dimension k and minimum distance d over GF(q) is denoted by [n, k, d](q). One of the main problem in linear coding theory is - for given length and dimension to construct codes with best possible minimum distances. In this talk we present 10 new QC codes.
引用
收藏
页码：51 / 54
页数：4
相关论文
共 50 条
12345