References
- R. Calderbank and W. M. Kantor, The geometry of two-weight codes, Bull. London Math. Soc. 18 (1986), no. 2, 97-122. https://doi.org/10.1112/blms/18.2.97
- J. H. Griesmer, A bound for error-correcting codes, IBM J. Res. Develop. 4 (1960), 532-542. https://doi.org/10.1147/rd.45.0532
- R. Hill, Optimal linear codes, Cryptography and coding, II (Cirencester, 1989), 75-104, Inst. Math. Appl. Conf. Ser. New Ser., 33, Oxford Univ. Press, New York, 1992.
- R. Hill and E. Kolev, A survey of recent results on optimal linear codes, Combinatorial Designs and their Applications (Milton Keynes, 1997), 127-152, Chapman Hall/CRC Res. Notes Math., 403, Chapman Hall/CRC, Boca Raton, FL, 1999.
- R. Hill and D. E. Newton, Optimal ternary linear codes, Des. Codes Cryptogr. 2 (1992), no. 2, 137-157. https://doi.org/10.1007/BF00124893
- J. W. P. Hirschfeld, Projective Geometries over Finite Fields, 2nd ed., Clarendon Press, Oxford, 1998.
- Y. Kageyama and T. Maruta, On the construction of Griesmer codes of dimension 5, Des. Codes Cryptogr. 75 (2016), no. 2, 277-280. https://doi.org/10.1007/s10623-013-9914-4
- F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland: New York, 1977.
- T. Maruta, Griesmer bound for linear codes over finite fields, http://www.mi.s.osakafu-u.ac.jp/-maruta/griesmer/.
- G. Solomon and J. J. Stiffler, Algebraically punctured cyclic codes, Inform. and Control 8 (1965), no. 2, 170-179. https://doi.org/10.1016/S0019-9958(65)90080-X