One central problem in coding theory is to optimize the parameters of a linear code and construct codes with best possible parameters. There are tables of best-known linear codes over nite elds of sizes up to 9. Recently, there has been a growing interest in codes over GF(11), over GF(13) and other elds of size greater than 9. The main purpose of this work is to present new databases of best-known linear codes over the elds GF(11) and GF(13) together with upper bounds on the minimum distances. To nd good linear codes to establish lower bounds on minimum distances, an iterative heuristic computer search algorithm is employed to construct quasi-twisted (QT) codes over these elds with high minimum distances. A large number of new linear codes have been found, improving previously best-known results. Tables of [pm, m] QT codes over the two elds with best-known minimum distances as well as a table of lower and upper bounds on the minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.
|Status||Publicerad - 2014|
|Evenemang||Karatekin Mathematics Days 2014, Çankırı, Turkey, 11-13 June, 2014 - |
Varaktighet: 1980-jan-01 → …
|Konferens||Karatekin Mathematics Days 2014, Çankırı, Turkey, 11-13 June, 2014|
|Period||80-01-01 → …|
- Data- och informationsvetenskap (102)