SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Combinatorial Theory, Series A

Volumn 57, Issue 1, 1991, Pages 117-129

Bounds on packings and coverings by spheres in q-ary and mixed Hamming spaces

(1) van Wee, G J M a

a EINDHOVEN UNIVERSITY OF TECHNOLOGY (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013542256 PISSN: 00973165 EISSN: 10960899 Source Type: Journal
DOI: 10.1016/0097-3165(91)90010-E Document Type: Article

Times cited : (24)

References (37)

1
- 0037749767
- More coverings by rook domains
- (1984) J. Combin. Theory Ser. A , vol.36 , pp. 240-244
- Blokhuis¹ Lam²

2
- 1842701126
- On covering and coloring problems for rook domains
- (1985) Discr. Math. , vol.57 , pp. 9-16
- Carnielli¹

3
- 0025432506
- Lower bounds forq-ary covering codes
- (1990) IEEE Trans. Inform. Theory , vol.36 , pp. 664-671
- Chen¹ Honkala²

4
- 0022777610
- Further results on the covering radius of codes
- (1986) IEEE Transactions on Information Theory , vol.32 , pp. 680-694
- Cohen¹ Lobstein² Sloane³

5
- 34547366945
- On a covering problem concerning abelian groups
- (1971) Journal of the London Mathematical Society , vol.3 , pp. 222-232
- Dickson¹

6
- 3643100624
- The football pool problem for 7 and 8 matches
- (1983) J. Combin. Theory Ser. A , vol.35 , pp. 109-114
- Fernandes¹ Rechtschaffen²

7
- 0039067310
- Rook domains latin squares affine planes and error-distributing codes
- (1964) IEEE Transactions on Information Theory , vol.10 , pp. 196-208
- Golomb¹ Posner²

8
- 0013548639
- Upper bounds for football pool problems and mixed covering codes
- (1991) Journal of Combinatorial Theory, Series A , vol.56 , pp. 84-95
- Hämäläinen¹ Rankinen²

9
- 0023981420
- Lower bounds for binary covering codes
- (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 326-329
- Honkala¹

10
- 84914614456
- I. S. Honkala, Modified bounds for covering codes, submitted for publication.

11
- 0024079571
- A new construction for covering codes
- (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 1343-1344
- Honkala¹ Hämäläinen²

12
- 84940470566
- A combinatorial problem in matching
- (1969) Journal of the London Mathematical Society , vol.44 , pp. 60-64
- Kalbfleisch¹ Stanton²

13
- 84940470566
- A combinatorial problem in matching
- (1969) Journal of the London Mathematical Society , vol.1 , pp. 398
- Kalbfleisch¹ Stanton²

14
- 0041837770
- On covering sets and error-correcting codes
- (1971) J. Combin. Theory Ser. A , vol.11 , pp. 233-250
- Kalbfleisch¹ Stanton² Horton³

15
- 77956667286
- Some new results for the covering problem
- W.T. Tutte, Proc. 3rd Waterloo Conf. Combinatorics 1968, Academic Press, New York
- (1969) Recent Progress in Combinatorics
- Kalbfleisch¹ Weiland²

16
- 0040414523
- A covering problem
- P. Erdos et al., Colloquia Mathematica Societatis János Bolyai, North-Holland, Amsterdam/New York
- (1970) Combinatorial Theory and Its Applications , vol.4 , pp. 679-685
- Kamps¹ van Lint²

17
- 0000952108
- The football pool problem for 5 matches
- (1967) J. Combin. Theory , vol.3 , pp. 315-325
- Kamps¹ van Lint²

18
- 38249006210
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- (1989) J. Combin. Theory Ser. A , vol.52 , pp. 304-312
- van Laarhoven¹ Aarts² van Lint³ Wille⁴

19
- 0038426060
- Covering Radius Problems
- Eindhoven University of Technology
- (1988) Master's Thesis
- van Lint¹

20
- 0013551418
- Generalized bounds on binary/ternary mixed packing and covering codes
- (1991) J. Combin. Theory Ser. A , vol.57 , pp. 130-143
- van Lint¹ van Wee²

21
- 0024768227
- On normal and subnormalq-ary codes
- (1989) IEEE Trans. Inform. Theory , vol.35 , pp. 1291-1295
- Lobstein¹ van Wee²

22
- 77956697289
- On normal and subnormalq-ary codes
- (1990) IEEE Transactions on Information Theory , vol.36 , pp. 1498
- Lobstein¹ van Wee²

23
- 0003362940
- Note on a theorem of Zaremba
- (1969) J. Combin. Theory , vol.6 , pp. 208-209
- Losey¹

24
- 84914604122
- Sopra una particolare proprietàdei gruppi abeliani finiti
- (1950) Ann. Scuola Norm. Sup. Pisa (3) , vol.3 , pp. 59-65
- Mattioli¹

25
- 84963082137
- Covering theorems for groups
- (1950) The Quarterly Journal of Mathematics , vol.1 , pp. 284-287
- Mauldon¹

26
- 0000225873
- Coverings by rook domains
- (1970) J. Combin. Theory , vol.9 , pp. 117-128
- Rodemich¹

27
- 3643093296
- Covering theorems in groups (or: How to win at football pools)
- W.T. Tutte, Proc. 3rd Waterloo Conf. Combinatorics 1968, Academic Press, New York
- (1969) Recent Progress in Combinatorics
- Stanton¹

28
- 84963056780
- Covering theorems for vectors with special reference to the case of four and five components
- (1969) Journal of the London Mathematical Society , vol.1 , pp. 493-499
- Stanton¹ Horton² Kalbfleisch³

29
- 34250503264
- Covering problems for dichotomized matchings
- (1968) Aequationes Math. , vol.1 , pp. 94-103
- Stanton¹ Kalbfleisch²

30
- 0000868360
- Intersection inequalities for the covering problem
- (1969) SIAM Journal on Applied Mathematics , vol.17 , pp. 1311-1316
- Stanton¹ Kalbfleisch²

31
- 0348148197
- Covering theorems for groups
- (1948) Ann. Soc. Math. Polon. , vol.21 , pp. 303-305
- Taussky¹ Todd²

32
- 77956681390
- Some discrete variable computations
- Amer. Math. Soc., Providence, R.I.
- (1960) Proceedings of Symposia in Applied Mathematics , vol.10 , pp. 201-209
- Taussky¹ Todd²

33
- 0009764381
- On the football pool problem for 6 matches: A new upper bound
- (1983) J. Combin. Theory Ser. A , vol.35 , pp. 106-108
- Weber¹

34
- 0023981711
- Improved sphere bounds on the covering radius of codes
- (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 237-245
- van Wee¹

35
- 38249035557
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
- (1987) J. Combin. Theory Ser. A , vol.45 , pp. 171-177
- Wille¹

36
- 84963032994
- A covering theorem for abelian groups
- (1950) J. London Math. Soc. , vol.26 , pp. 71-72
- Zaremba¹

37
- 84963062628
- Covering problems concerning abelian groups
- (1952) Journal of the London Mathematical Society , vol.27 , pp. 242-246
- Zaremba¹

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