Author of the publication

A characterization of some \3v1 + v3, 3v0 + v2; 3, 3\-minihypers and its applications to error-correcting codes

, and . Journal of Statistical Planning and Inference, 56 (1): 147--169 (Dec 1, 1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Nonexistence of Quaternary Linear Codes With Parameters 243, 5, 181, 248, 5, 185 and 240, 5, 179.. Ars Comb., (1999)The Nonexistence of Ternary 38, 6, 23 Codes., and . Des. Codes Cryptogr., 13 (2): 165-172 (1998)Partition of a query set into minimal number of subsets having consecutive retrieval property, , , , , and . Journal of Statistical Planning and Inference, 1 (1): 41--51 (February 1977)A characterization of some \3v2 + v3, 3v1 + v2; 3, 3\-minihypers and some 15, 4, 9; 3-codes with B2 = 0, and . Journal of Statistical Planning and Inference, 56 (1): 129--146 (Dec 1, 1996)The nonexistence of 71,5,46;3-codes, and . Journal of Statistical Planning and Inference, 52 (3): 379--394 (Jul 1, 1996)A characterization of 2valpha+1 + 2vbeta+1, 2valpha + 2vbeta; t, q- minihypers in PG(t, q) (t >= 2, q >= 5 and 0 >= alpha < beta < t) and its applications to error-correcting codes., and . Discret. Math., 93 (1): 19-33 (1991)Characterization of vμ+1 + 2vμ, vμ + 2vμ - 1;t, q-min · hypers and its applications to error-correcting codes.. Graphs Comb., 5 (1): 137-147 (1989)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, and . Journal of Statistical Planning and Inference, 34 (3): 387--402 (March 1993)Characterization of 2(q+1)+2, 2;t, q-minihypers in PG(t, q) (t>=3, qepsilon3, 4)., , and . Discret. Math., 115 (1-3): 175-185 (1993)A characterization of some 3vµ+1, 3vµ; k-1, q-minihypers and some n, k, qk-1 - 3qµ; q-codes (k >= 3, q >= 5, 1 <= µ < k-1) meeting the Griesmer bound., and . Discret. Math., 146 (1-3): 59-67 (1995)