메뉴 건너뛰기




Volumn 43, Issue 6, 1997, Pages 2057-2061

Covering radii of ternary linear codes of small dimensions and codimensions

Author keywords

Covering radius; Least covering radius; Ternary linear codes

Indexed keywords

MATRIX ALGEBRA; VECTORS;

EID: 0031269953     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.641577     Document Type: Article
Times cited : (9)

References (7)
  • 4
    • 84987820094 scopus 로고
    • An improved upper bound on covering radius
    • Berlin, Germany: Springer-Verlag
    • H. F. Mattson, Jr., "An improved upper bound on covering radius," in Lecture Notes in Computer Science, no. 228. Berlin, Germany: Springer-Verlag, 1986, pp. 90-106.
    • (1986) Lecture Notes in Computer Science , Issue.228 , pp. 90-106
    • Mattson Jr., H.F.1
  • 5
    • 0345753322 scopus 로고
    • A new approach to the covering radius of codes
    • N. J. A. Sloane, "A new approach to the covering radius of codes," J. Comb. Theory, ser. A, vol. 42, no. 1, pp. 61-86, 1986.
    • (1986) J. Comb. Theory, Ser. A , vol.42 , Issue.1 , pp. 61-86
    • Sloane, N.J.A.1
  • 7
    • 0025603575 scopus 로고
    • A generalization of some upper bounds on covering radius under an arbitrary additive metric
    • _, "A generalization of some upper bounds on covering radius under an arbitrary additive metric," Probl. Contr. Inform. Theory, vol. 19, nos. 5/6, pp. 445-450, 1990.
    • (1990) Probl. Contr. Inform. Theory , vol.19 , Issue.5-6 , pp. 445-450


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