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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2020 Algebraic and Combinatorial Coding Theory (ACCT) S. 1 - 4
Hauptverfasser: Daskalov, Rumen, Metodieva, Elena
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 11.10.2020
Schlagworte:
cyclic codes
Finite field
Information theory
Linear codes
QC codes
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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