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.

Saved in:
Bibliographic Details
Published in:2020 Algebraic and Combinatorial Coding Theory (ACCT) pp. 1 - 4
Main Authors: Daskalov, Rumen, Metodieva, Elena
Format: Conference Proceeding
Language:English
Published: IEEE 11.10.2020
Subjects:
cyclic codes
Finite field
Information theory
Linear codes
QC codes
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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