Note on an Improvement of the Griesmer Bound for q-ary Linear Codes

Authors

  • Noboru Hamada
  • Tatsuya Maruta

DOI:

https://doi.org/10.55630/sjc.2011.5.199-206

Keywords:

Linear Codes, Griesmer Bound

Abstract

Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k and d with k ≥ 3, 1 ≤ d ≤ q^(k−1) and a prime or a prime power q. The purpose of this note is to show that there exists a series of the functions h3,q, h4,q, ..., hk,q such that nq(k, d) can be expressed.

Downloads

Published

2011-10-26

Issue

Section

Articles