APPLIED MATHEMATICS LETTERS, cilt.15, ss.833-836, 2002 (SCI İndekslerine Giren Dergi)
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 quasi-cyclic codes over F-5, 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. (C) 2002 Elsevier Science Ltd. All rights reserved.