The non-existence of Griesmer codes with parameters close to codes of Belov type (Q717146): Difference between revisions

The central question of classical coding theory is finding optimal \([n,k,d]\) codes. For an \([n,k,d]\) code over the field of order \(q\) the Griesmer bound states that \(n\geq \sum_{i=0}^{k-1} \lceil {{d}\over{q^i}} \rceil.\) Hill and Kolev have given a class of codes which meet this bound, called codes of Belov type. Through a series of related theorems the author proves that there are no linear codes meeting this bound for values of \(d\) in a specific interval. This allows the author to conclude that the lower bounds for \(d\) of Belov type are sharp. Additionally, the author gives a class of length-optimal codes with \(n_q(k,d) = g_q(k,d) +1\), where \(n_q(k,d)\) is the smallest value of \(n\) for which there exists an \([n,k,d]\) code over the field of order \(q\) and \(g_q(k,d)\) is the length given by the Griesmer bound.