New QC Codes over GF(11)

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.

Uloženo v:
Podrobná bibliografie
Vydáno v:2020 Algebraic and Combinatorial Coding Theory (ACCT) s. 1 - 4
Hlavní autoři: Daskalov, Rumen, Metodieva, Elena
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 11.10.2020
Témata:
cyclic codes
Finite field
Information theory
Linear codes
QC codes
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
DOI:10.1109/ACCT51235.2020.9383337