메뉴 건너뛰기




Volumn 18, Issue 1-3, 1999, Pages 223-229

A Class of Perfect Ternary Constant-Weight Codes

Author keywords

Optimal nonlinear codes; Perfect codes; Ternary constant weight codes

Indexed keywords


EID: 0004607486     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008361925021     Document Type: Article
Times cited : (21)

References (11)
  • 4
    • 0040494939 scopus 로고    scopus 로고
    • k and generalized designs
    • k and generalized designs, Discrete Mathematics, Vol. 169 (1997) pp. 55-82.
    • (1997) Discrete Mathematics , vol.169 , pp. 55-82
    • Etzion, T.1
  • 6
    • 0001336166 scopus 로고
    • A new upper bound for error-correcting codes
    • S. M. Johnson, A new upper bound for error-correcting codes, IRE Transactions on Information Theory, Vol. IT-8, No. 3 (1962) pp. 203-207.
    • (1962) IRE Transactions on Information Theory , vol.IT-8 , Issue.3 , pp. 203-207
    • Johnson, S.M.1
  • 8
    • 0031234377 scopus 로고    scopus 로고
    • A lower bound for ternary constant weight codes
    • M. Svanström, A lower bound for ternary constant weight codes, IEEE Transactions on Information Theory, Vol. 43, No. 5 (1997) pp. 1630-1632.
    • (1997) IEEE Transactions on Information Theory , vol.43 , Issue.5 , pp. 1630-1632
    • Svanström, M.1
  • 10
    • 26744472375 scopus 로고    scopus 로고
    • Constructing optimal ternary constant-weight codes by placing pieces on chessboards
    • Cambridge, MA, USA
    • M. Svanström, Constructing optimal ternary constant-weight codes by placing pieces on chessboards, Proceedings 1998 IEEE International Symposium on Information Theory, Cambridge, MA, USA (1998) p. 66.
    • (1998) Proceedings 1998 IEEE International Symposium on Information Theory , pp. 66
    • Svanström, M.1


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