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žené v:
Podrobná bibliografia
Vydané v:2020 Algebraic and Combinatorial Coding Theory (ACCT) s. 1 - 4
Hlavní autori: Daskalov, Rumen, Metodieva, Elena
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 11.10.2020
Predmet:
cyclic codes
Finite field
Information theory
Linear codes
QC codes
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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