Elsevier

Discrete Mathematics

Volume 275, Issues 1–3, 28 January 2004, Pages 97-110
Discrete Mathematics

New minimum distance bounds for linear codes over GF(5)☆

https://doi.org/10.1016/S0012-365X(03)00126-2Get rights and content
Under an Elsevier user license
open archive

Abstract

Let [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, 32 new codes over GF(5) are constructed and the nonexistence of 51 codes is proved.

Keywords

Linear codes over GF(5)
Quasi-cyclic codes
Quasi-twisted codes
Linear programming bound

Cited by (0)

☆

This work was partially supported by the Bulgarian National Science Fund under contract in TU-Gabrovo.

Copyright © 2003 Elsevier B.V. All rights reserved.