论文信息 - On codes meeting the Griesmer bound - 字舞流文

On codes meeting the Griesmer bound

We investigate codes meeting the Griesmer bound. The main theorem of this article is the generalization of the nonexistence theorem of Maruta (Des. Codes Cryptography 12 (1997) 83-87) to a larger class of codes.

[1] Tor Helleseth,et al. Projective codes meeting the Griesmer bound , 1992, Discret. Math..

[2] Noboru Hamada,et al. A characterization of some [n, k, d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry , 1993, Discret. Math..

[3] Christopher Jones,et al. Optimal linear codes. , 1999 .

[4] Tatsuya Maruta. On the Achievement of the Griesmer Bound , 1997, Des. Codes Cryptogr..

[5] James H. Griesmer,et al. A Bound for Error-Correcting Codes , 1960, IBM J. Res. Dev..

[6] Fumikazu Tamari,et al. A construction of some [n, k, d; q]-codes meeting the Griesmer bound , 1993, Discret. Math..

[7] Ray Hill,et al. On the nonexistence of some quaternary codes , 1996 .

[8] Jack J. Stiffler,et al. Algebraically Punctured Cyclic Codes , 1965, Inf. Control..