Skip to main content
Log in

Bounds on Minimum Distance for Linear Codes over GF(5)

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

Let [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). Let d 5(n, k) be the maximum possible minimum Hamming distance of a linear [n, k, d; 5]-code for given values of n and k. In this paper, forty four new linear codes over GF(5) are constructed and a table of d 5(n, k) k≤ 8, n≤ 100 is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daskalov, R., Gulliver, T. Bounds on Minimum Distance for Linear Codes over GF(5). AAECC 9, 547–558 (1999). https://doi.org/10.1007/s002000050117

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050117

Navigation