Title of article
New quasi-cyclic codes over F5 Original Research Article
Author/Authors
N. Aydin، نويسنده , , I. Siap، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
4
From page
833
To page
836
Abstract
One of the most important problems of coding theory is to construct codes with best possible minimum distances. In this paper, we use the algebraic structure of quasi-cyclic codes and the BCH type bound on the minimum distance to search for quasicyclic codes over View the MathML source5, the finite field with five elements, which improve the minimum distances of best-known linear codes. We construct 15 new linear codes of this type.
Keywords
Quasi-cyclic codes , Linear codes over View the MathML source5 , New bounds
Journal title
Applied Mathematics Letters
Serial Year
2002
Journal title
Applied Mathematics Letters
Record number
897421
Link To Document