New Quasi-cyclic Degenerate Linear Codes over GF(8)

Authors: Daskalov R.¹; Hristov P.²

Source: Problems of Information Transmission, Volume 39, Number 2, April 2003 , pp. 184-190(7)

Publisher: MAIK Nauka/Interperiodica

Buy & download fulltext article:

Price: $45.00 plus tax (Refund Policy)

Abstract:

Let [n, k, d]_q code be a linear code of length n, dimension k, and minimum Hamming distance d over GF(q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes were proved to contain many such codes. In this paper, twenty-five new codes over GF(8) are constructed, which improve the best known lower bounds on minimum distance.

Language: English

Document Type: Research article

Affiliations: 1: Department of Mathematics, Technical University of Gabrovo, Bulgaria daskalov@tugab.bg 2: Department of Mathematics, Technical University of Gabrovo, Bulgaria

Publication date: 2003-04-01