메뉴 건너뛰기




Volumn 52, Issue 3, 1996, Pages 379-394

The nonexistence of [71,5,46;3]-codes

Author keywords

Griesmer bound; Linear codes; Minihypers; Packing problem

Indexed keywords


EID: 0030191358     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/0378-3758(95)00126-3     Document Type: Article
Times cited : (9)

References (25)
  • 2
    • 0000056597 scopus 로고
    • On some connections between the design of experiment and information theory
    • Bose, R.C. (1961). On some connections between the design of experiment and information theory. Bull. Inst. Internat. Statist. 38, 257-271.
    • (1961) Bull. Inst. Internat. Statist. , vol.38 , pp. 257-271
    • Bose, R.C.1
  • 3
    • 0000146647 scopus 로고
    • On a bound useful in the theory of factorial designs and error-correcting codes
    • Bose, R.C. and J.N. Srivastava (1964). On a bound useful in the theory of factorial designs and error-correcting codes. Ann. Math. Statist. 35, 408-414.
    • (1964) Ann. Math. Statist. , vol.35 , pp. 408-414
    • Bose, R.C.1    Srivastava, J.N.2
  • 4
    • 0011556094 scopus 로고    scopus 로고
    • Tables of codes
    • R. Brualdi, W.C. Huffman and V. Pless, Eds., North-Holland, Amsterdam, to appear
    • Brouwer, A.E. and N.J.A. Sloane (1996). Tables of codes. In: R. Brualdi, W.C. Huffman and V. Pless, Eds., Handbook of Coding Theory. North-Holland, Amsterdam, to appear.
    • (1996) Handbook of Coding Theory
    • Brouwer, A.E.1    Sloane, N.J.A.2
  • 5
    • 0029404937 scopus 로고
    • Some new results for ternary linear codes of dimension 5 and 6
    • Eupen, M. van (1995). Some new results for ternary linear codes of dimension 5 and 6. IEEE Trans. Inform. Theory 41, 2048-2051.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 2048-2051
    • Van Eupen, M.1
  • 7
    • 0000599906 scopus 로고
    • An optimal ternary [69,5,45] code and related codes
    • Eupen, M. van and R. Hill (1994). An optimal ternary [69,5,45] code and related codes. Designs, Codes Cryptography 4, 271-282.
    • (1994) Designs, Codes Cryptography , vol.4 , pp. 271-282
    • Van Eupen, M.1    Hill, R.2
  • 8
    • 0000210106 scopus 로고
    • A bound for error-correcting codes
    • Griesmer, J.H. (1960). A bound for error-correcting codes. IBM J. Res. Develop. 4, 532-542.
    • (1960) IBM J. Res. Develop. , vol.4 , pp. 532-542
    • Griesmer, J.H.1
  • 9
    • 38248999131 scopus 로고
    • A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
    • Hamada, N. (1993a). A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry. Discrete Math. 116, 229-268.
    • (1993) Discrete Math. , vol.116 , pp. 229-268
    • Hamada, N.1
  • 10
    • 0000433121 scopus 로고
    • A survey of recent work on characterization of minihypers in PG(t,q) and nonbinary linear codes meeting the Griesmer bound
    • Hamada, N. (1993b). A survey of recent work on characterization of minihypers in PG(t,q) and nonbinary linear codes meeting the Griesmer bound. J. Combin. Inform. Syst. Sci. 18, 161-191.
    • (1993) J. Combin. Inform. Syst. Sci. , vol.18 , pp. 161-191
    • Hamada, N.1
  • 11
    • 38249011666 scopus 로고
    • γ; 3]-codes (k ≥ 3, 0 ≤ α < γ < k-1) meeting the Griesmer bound
    • γ; 3]-codes (k ≥ 3, 0 ≤ α < γ < k-1) meeting the Griesmer bound. Discrete Math. 104, 67-81.
    • (1992) Discrete Math. , vol.104 , pp. 67-81
    • Hamada, N.1    Helleseth, T.2
  • 13
    • 0000429956 scopus 로고
    • A characterization of some ternary codes meeting the Griesmer bound
    • Hamada, N. and T. Helleseth (1994). A characterization of some ternary codes meeting the Griesmer bound. AMS Ser. Contemp. Math. 168, 139-150.
    • (1994) AMS Ser. Contemp. Math. , vol.168 , pp. 139-150
    • Hamada, N.1    Helleseth, T.2
  • 14
    • 0030510742 scopus 로고    scopus 로고
    • 2; 3,3}-minihypers and some [15,4,9;3]-codes with B2 = 0
    • (special volume) to appear
    • 2; 3,3}-minihypers and some [15,4,9;3]-codes with B2 = 0. J. Statist. Plann. Inference (special volume), to appear.
    • (1996) J. Statist. Plann. Inference
    • Hamada, N.1    Helleseth, T.2
  • 15
    • 0002987488 scopus 로고    scopus 로고
    • 3;4,3}-minihypers and projective ternary [78,5,51]-codes
    • to appear
    • 3;4,3}-minihypers and projective ternary [78,5,51]-codes. Math. Japon. 43, to appear.
    • (1996) Math. Japon. , vol.43
    • Hamada, N.1    Helleseth, T.2
  • 16
    • 0003083186 scopus 로고
    • The nonexistence of [51,5,33;3] codes
    • Hamada, N., T. Helleseth and Ø. Ytrehus (1993). The nonexistence of [51,5,33;3] codes. Ars Combin. 35, 25-32.
    • (1993) Ars Combin. , vol.35 , pp. 25-32
    • Hamada, N.1    Helleseth, T.2    Ytrehus, Ø.3
  • 17
    • 0030495645 scopus 로고    scopus 로고
    • 2; 3,3}-minihypers and its applications to error-correcting codes
    • (special volume) to appear
    • 2; 3,3}-minihypers and its applications to error-correcting codes. J. Statist. Plann. Inference (special volume), to appear.
    • (1996) J. Statist. Plann. Inference
    • Hamada, N.1    Maekawa, T.2
  • 19
    • 0000456375 scopus 로고
    • A characterization of codes meeting the Griesmer bound
    • Helleseth, T. (1981). A characterization of codes meeting the Griesmer bound. Inform. and Control 50, 128-159.
    • (1981) Inform. and Control , vol.50 , pp. 128-159
    • Helleseth, T.1
  • 20
    • 0000352095 scopus 로고
    • Caps and codes
    • Hill, R. (1978). Caps and codes. Discrete Math. 22, 111-137.
    • (1978) Discrete Math. , vol.22 , pp. 111-137
    • Hill, R.1
  • 23
    • 0000163235 scopus 로고
    • Algebraically punctured cyclic codes
    • Solomon, G. and J.J. Stiffler (1965). Algebraically punctured cyclic codes. Inform. and Control 8, 170-179.
    • (1965) Inform. and Control , vol.8 , pp. 170-179
    • Solomon, G.1    Stiffler, J.J.2
  • 24
    • 0001768058 scopus 로고
    • A note on the construction of optimal linear codes
    • Tamari, F. (1981). A note on the construction of optimal linear codes. J. Statist. Plann. Inference 5, 405-411.
    • (1981) J. Statist. Plann. Inference , vol.5 , pp. 405-411
    • Tamari, F.1
  • 25
    • 0000783315 scopus 로고
    • On linear codes which attain the Solomon-Stiffler bound
    • Tamari, F. (1984). On linear codes which attain the Solomon-Stiffler bound. Discrete Math. 49, 179-191.
    • (1984) Discrete Math. , vol.49 , pp. 179-191
    • Tamari, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.