SCOPUS 정보 검색 플랫폼

Volumn 6, Issue 3, 1995, Pages 219-227

Two new bounds on the size of binary codes with a minimum distance of three

Author keywords

bounds on the size of a code; constant weight codes; optimal codes

Indexed keywords

EID: 0000306025 PISSN: 09251022 EISSN: 15737586 Source Type: Journal
DOI: 10.1007/BF01388476 Document Type: Article

Times cited : (6)

References (10)

1
- 84936132977
- An examination of the nonisomorphic solutions to a problem in covering designs in fifteen points
- (1988) Math. Comp. , vol.4 , pp. 189-206
- Allston, J.L.¹ Buskens, R.W.² Stanton, R.G.³

2
- 0019079806
- Binary codes with a minimum distance of four
- (1980) IEEE Transactions on Information Theory , vol.26 , pp. 738-742
- Best, M.R.¹

5
- 84936153530
- J. H. Conway and N. J. A. Sloane, Quaternary constructions for the binary codes of Julin, Best, and others, Designs, Codes, and Cryptography, to appear.

6
- 84916284602
- Two improved block codes
- (1965) IEEE Transactions on Information Theory , vol.11 , pp. 459
- Julin, D.¹

8
- 84936119618
- S. Litsyn and A. Vardy, The uniqueness of the Best code, IEEE Trans. Inform. Theory. to appear.

10
- 0141933112
- On upper bounds for error-detecting and error-correcting codes of finite length
- (1959) IEEE Transactions on Information Theory , vol.5 , pp. 168-174
- Wax, N.¹

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