Optimal linear codes of dimension 4 over F5

IEEE Transactions on Information Theory

Volumn 43, Issue 1, 1997, Pages 308-313

  Boukliev, Iliya ^a   Kapralov, Stoyan ^b   Maruta, Tatsuya ^c   Fukui, Masaharu ^c  

^a BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

^b TECHNICAL UNIVERSITY OF GABROVO   (Bulgaria)

^c MEIJO UNIVERSITY   (Japan)

Author keywords

Minimum length bounds; Optimal q ary linear codes

Indexed keywords

COMBINATORIAL MATHEMATICS; ENCODING (SYMBOLS); MATHEMATICAL MODELS; OPTIMIZATION;

LINEAR CODES; MINIMUM LENGTH BOUNDS;

CODES (SYMBOLS);

EID: 0030822450     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567723     Document Type: Article

References (31)

1. M. C. Bhandari and M. S. Garg., "Optimum codes of dimension 3 and 4 over GF(4)," IEEE Trans. Inform. Theory, vol. 38, pp. 1564-1567, 1992.
2. G. Bogdanova and I. Bouldiev, "New linear codes of dimension 5 over GF(3)," in Proc. 4th Int. Workshop on Algebraic and Combinatorial Coding Theory, ACCT-4 (Novgorod, Russia, Sept. 11-17, 1994), pp. 41-43.
3. I. Boukliev, "A method for construction of good linear codes and its application to ternary and quaternary codes," in Proc. Int. Workshop on Optimal Codes and Related Topics (Sozopol, Bulgaria, May 26-June 1, 1995), pp. 15-20.
4. 5," in Proc. 25th Spring Conf. of the Union of Bulgarian Mathematicians (Kazanlak, Bulgaria, Apr. 6-9, 1996), to be published.
5. A. E. Brouwer and M. van Eupen, "The correspondence between projective codes and 2-weight codes," Des., Codes Cryptogr., to be published.
6. A. R. Calderbank and W. M. Kantor, "The geometry of two-weight codes," Bull. London Math. Soc., vol. 18, pp. 97-122, 1986.
7. S. M. Dodunekov, "Minimum block length of a linear q-ary code with specified dimension and code distance," Probl. Inform. Transm., vol 20, pp. 239-249, 1984.
8. M. van Eupen, "Five new optimal ternary linear codes," IEEE Trans. Inform. Theory, vol. 40, p. 193, Jan. 1994.
9. M. van Eupen, N. Hamada, and Y. Watamori, "The nonexistence of [50, 5, 32; 3]-codes," Des., Codes Cryptogr., to be published.
10. P. P. Greenough and R. Hill, "Optimal linear codes over GF(4)", Discr. Math., vol. 125, pp. 187-199, 1994.
11. J. H. Griesmer, "A bound for error-corecting codes", IBM. J Res. Develop., vol. 4, pp. 532-542, 1960.
12. T. A. Gulliver, "Construction of quasicyclic codes," Ph.D. dissertation, Dept. Elec. Comput. Eng., University of Victoria, 1989.
13. N. Hamada, "Characterization of minihypers in a finite projective geometry and its applications to error-correcting codes," Bull. Osaka Women's Univ., vol. 24, pp. 1-24, 1987.
14. 2 + q; q]-code meeting the Griesmer bound," in Proc. Int. Workshop on Algebraic and Combinatorial Coding Theory (Voneshta Voda, Bulgaria, June 22-28, 1992), pp. 80-83.
15. N. Hamada and F. Tamari, "Construction of optimal codes and optimal fractional factorial designs using linear programming," Ann. Discr. Math., vol. 6, pp. 175-188, 1980.
16. N. Hamada and Y. Watamori, "The nonexistence of [71,5,46; 3]-codes," J. Statist. Plann. Inference, to be published.
17. R. Hill, "Optimal linear codes," in Cryptography and Coding II, C. Mitchell, Ed. Oxford, UK: Oxford Univ. Press, 1992, pp. 75-104.
18. R. Hill and P. P. Greenough, "Optimal quasitwisted codes," in Proc. Int. Workshop on Algebraic and Combinatorial Coding Theory (Voneshta Voda, Bulgaria, June 22-28, 1992), pp. 92-97.
19. R. Hill and I. Landgev, "On the nonexistence of some quaternary codes," in Proc. (MA Conf. on Finite Fields and Their Applications, June 1994, to be published.
20. R. Hill and D. E. Newton, "Optimal ternary linear codes," Des., Codes Cryptogr., vol. 2, pp. 137-157, 1992.
21. J. W. P. Hirschfeld, Projective Geometries over Finite Fields. Oxford, UK: Clarendon, 1979.
22. _, Finite Projective Spaces of Three Dimensions. Oxford, UK: Oxford Univ. Press, 1985.
23. 3 codes," in Proc. Int. Workshop on Optimal Codes and Related Topics (Sozopol, Bulgaria, May 26-June 1, 1995), pp. 108-116.
24. I. Landgev, T. Maruta, and R. Hill. "On the nonexistence of quaternary [51, 4, 37] codes," Finite Fields and their Applications, to be published.
25. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
26. T. Maruta, "On the nonexistence of linear codes attaining the Griesmer bound," Geometriae Dedicata, to be published.
27. _, "On the nonexistence of linear codes of dimension four attaining the Griesmer bound," in Proc. Int. Workshop on Optimal Codes and Related Topics (Sozopol, Bulgaria, May 26-June 1, 1995), pp. 117-120.
28. T. Maruta and M. Fukui, "On the nonexistence of some linear codes of dimension four over GF(5)," submitted for publication.
29. J. Mason, "On (k, n)-arcs and (k, n)-caps in finite projective geometries," Ph.D. dissertation, University of Salford, 1980.
30. G. Solomon and J. J. Stiffler, "Algebraically punctured cyclic codes," Inform. Contr., vol. 8, pp. 170-179, 1965.
31. H. C. A. van Tilborg, "The smallest length of binary 7-dimensional linear codes with prescribed minimum distance," Discr. Math., vol. 33, pp. 197-207, 1981.