SCOPUS 정보 검색 플랫폼

Volumn 17, Issue 2-3, 1996, Pages 265-270

Upper bounds on the covering radius of a code with a given dual distance

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038969878 PISSN: 01956698 EISSN: None Source Type: Journal
DOI: 10.1006/eujc.1996.0022 Document Type: Article

Times cited : (14)

References (12)

1
- 0002598638
- Diameter, covering index, covering radius and eigenvalues
- C. Delorme and P. Solé, Diameter, covering index, covering radius and eigenvalues, Europ. J. Combin., 12 (1991), 95-108.
- (1991) Europ. J. Combin. , vol.12 , pp. 95-108
- Delorme, C.¹ Solé, P.²

2
- 0015735548
- Four fundamental parameters of a code and their combinatorial significance
- P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Inform. Control, 23 (1973), 407-438.
- (1973) Inform. Control , vol.23 , pp. 407-438
- Delsarte, P.¹

3
- 0022077547
- On the covering radius of cyclic linear codes and arithmetic codes
- T. Helleseth, On the covering radius of cyclic linear codes and arithmetic codes, Discr. Appl. Math., 11 (1985), 157-173.
- (1985) Discr. Appl. Math. , vol.11 , pp. 157-173
- Helleseth, T.¹

4
- 0000726666
- On the covering radius of binary codes
- T. Helleseth, T. Kløve and J. Mykkeltveit, On the covering radius of binary codes, IEEE Trans. Inform. Theory, 24 (1978) 627-628.
- (1978) IEEE Trans. Inform. Theory , vol.24 , pp. 627-628
- Helleseth, T.¹ Kløve, T.² Mykkeltveit, J.³

5
- 0017468074
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- R. J. McEliece, E. R. Rodemich, H. C. Rumsey, Jr. and L. R. Welch, New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities, IEEE Trans. Inform. Theory, 23 (1977), 157-166.
- (1977) IEEE Trans. Inform. Theory , vol.23 , pp. 157-166
- McEliece, R.J.¹ Rodemich, E.R.² Rumsey H.C., Jr.³ Welch, L.R.⁴

6
- 0025522795
- Asymptotic bounds on the covering radius of binary codes
- P. Solé, Asymptotic bounds on the covering radius of binary codes, IEEE Trans. Inform. Theory, 36 (1990), 1470-1472.
- (1990) IEEE Trans. Inform. Theory , vol.36 , pp. 1470-1472
- Solé, P.¹

7
- 0025993180
- Generalization of the Norse bounds to codes of higher strength
- P. Solé and K. G. Mehrotra, Generalization of the Norse bounds to codes of higher strength, IEEE Trans. Inform. Theory, 37 (1991), 190-192.
- (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 190-192
- Solé, P.¹ Mehrotra, K.G.²

8
- 0027629032
- Covering radius, codimension, and dual-distance width
- P. Solé and P. Stokes, Covering radius, codimension, and dual-distance width, IEEE Trans. Inform. Theory, 39 (1993), 1195-1203.
- (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1195-1203
- Solé, P.¹ Stokes, P.²

9
- 0003199229
- American Mathematical Society, Colloquium Publications, Providence, Rhode Island, fourth edition
- G. Szegö, Orthogonal Polynomials, American Mathematical Society, Colloquium Publications, Volume XXIII, Providence, Rhode Island, fourth edition, 1975.
- (1975) Orthogonal Polynomials , vol.23
- Szegö, G.¹

10
- 0039824097
- Codes and Character Sums
- A. Tietäväinen, Codes and Character Sums, Springer Lecture Notes in Computer Science, vol. 388 1989, pp. 3-12.
- (1989) Springer Lecture Notes in Computer Science , vol.388 , pp. 3-12
- Tietäväinen, A.¹

11
- 0025519421
- An upper bound on the covering radius as a function of its dual distance
- A. Tietäväinen, An upper bound on the covering radius as a function of its dual distance, IEEE Trans. Inform. Theory, 36 (1990), 1472-1474.
- (1990) IEEE Trans. Inform. Theory , vol.36 , pp. 1472-1474
- Tietäväinen, A.¹

12
- 0041010738
- Covering radius and dual distance
- A. Tietäväinen, Covering radius and dual distance, Designs, Codes and Cryptography, 1 (1991), 31-46.
- (1991) Designs, Codes and Cryptography , vol.1 , pp. 31-46
- Tietäväinen, A.¹

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