8 citations to 10.1016/0012-365X(89)90353-1 (Crossref Cited-By Service)

1. Fumikazu Tamari, “A construction of some [n, k, d; q]-codes meeting the Griesmer bound”, Discrete Mathematics, 116, no. 1-3, 1993, 269  
2. Noboru Hamada, “A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry”, Discrete Mathematics, 116, no. 1-3, 1993, 229  
3. R. Hill, D. E. Newton, “Optimal ternary linear codes”, Des Codes Crypt, 2, no. 2, 1992, 137  
4. Stefan Dodunekov, Juriaan Simonis, Numbers, Information and Complexity, 2000, 245  
5. Keisuke Shiromoto, Leo Storme, “A Griesmer Bound for Codes over Finite Quasi-Frobenius Rings”, Electronic Notes in Discrete Mathematics, 6, 2001, 337  
6. H. Janwa, 539, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 1991, 19  
7. Keisuke Shiromoto, Leo Storme, “A Griesmer bound for linear codes over finite quasi-Frobenius rings”, Discrete Applied Mathematics, 128, no. 1, 2003, 263  
8. Noboru Hamada, Tor Helleseth, “A characterization of some {v2+2v3, v1+2v2;k−1,3}-minihypers and some (vk−30,k,3k−1−21;3)-codes meeting the Griesmer bound”, Journal of Statistical Planning and Inference, 34, no. 3, 1993, 387