A New Class Of Nonbinary Codes Meeting The Griesmer Bound
N. Hamada, Tor Helleseth, Øyvind Ytrehus · 2005
A new class of codes over GF(q’) that meet the Griesmer bound are constructed in a simple way from the Solomon and Stiffler codes over GF(q). The new codes are, in general, not equivalent to the Solomon and Stiffler codes whenever I > 1.