메뉴 건너뛰기




Volumn 61, Issue , 2001, Pages 263-269

Classification of the [n, 3, n - 3]q NMDS codes over GF(7), GF(8) and GF(9)

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0348238533     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (14)

References (16)
  • 2
    • 0001240469 scopus 로고
    • Orthogonal arrays of strength two and three
    • R.C. Bose and K.A. Bush, Orthogonal arrays of strength two and three, Ann. Math. Stat. 23 (1952), 508-524.
    • (1952) Ann. Math. Stat. , vol.23 , pp. 508-524
    • Bose, R.C.1    Bush, K.A.2
  • 4
    • 0008973052 scopus 로고    scopus 로고
    • Classical arcs in PG(r, q) for 11 ≤ q ≤ 19
    • J.M. Chao and H. Kaneta, Classical arcs in PG(r, q) for 11 ≤ q ≤ 19, Discrete Math. 174 (1997), 87-94.
    • (1997) Discrete Math. , vol.174 , pp. 87-94
    • Chao, J.M.1    Kaneta, H.2
  • 6
    • 0008971979 scopus 로고    scopus 로고
    • Near-MDS codes over some small fields
    • S.M. Dodunekov and I. Landjev, Near-MDS codes over some small fields, Discrete Math. 213 (2000), 55-65.
    • (2000) Discrete Math. , vol.213 , pp. 55-65
    • Dodunekov, S.M.1    Landjev, I.2
  • 10
    • 0009019081 scopus 로고    scopus 로고
    • The packing problem in statistics, coding theory and finite projective spaces
    • J.W.P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces, J. Stat. Plann. Inference, 72 (1998), 335-380.
    • (1998) J. Stat. Plann. Inference , vol.72 , pp. 335-380
    • Hirschfeld, J.W.P.1    Storme, L.2
  • 12
  • 15
    • 33746357208 scopus 로고
    • Maximum distance separable q-nary codes
    • R.C. Singleton, Maximum distance separable q-nary codes, IEEE Trans. Inform. Theory, 10 (1964), 116-118.
    • (1964) IEEE Trans. Inform. Theory , vol.10 , pp. 116-118
    • Singleton, R.C.1


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