Advertisement

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E.H.L. AARTS AND P.J.M. VAN LAARHOVEN, Statistical Cooling: A General Approach to Combinatorial Optimization Problems, Philips J. of Research, 40 (1985), pp. 193–226.Google Scholar
  2. [2]
    M.J. ADAMS, Subcodes and covering radius, IEEE Trans. Information Theory, IT 32 (1986), pp. 700–701.Google Scholar
  3. [3]
    A. BLOKHUIS AND C.W.H. LAM, Coverings by Rook Domains, J. Combinatorial Theory, A35 (1984), pp. 240–244.Google Scholar
  4. [4]
    R.A. BRUALDI, V.S. PLESS AND R.M. WILSON, Short Codes with a Given Covering Radius, IEEE Trans. Information Theory (to appear).Google Scholar
  5. [5]
    R.A. BRUALDI AND V.S. PLESS, On the covering radius of a code and its subcodes, preprint.Google Scholar
  6. [6]
    On the length of codes with a given covering radius, preprint.Google Scholar
  7. [7]
    P.B. BUSSCHBACH, M.G.L. GERRETZEN AND H.C.A. VAN TILBORG, On the Covering Radius of Binary, Linear Codes Meeting the Griesmer Bound, IEEE Trans. Information Theory, IT 31 (1985), pp. 465–468.Google Scholar
  8. [8]
    A.R. CALDERBANK, Covering Radius and the Chromatic Number of Kneser Graphs, J. Combinatorial Theory (to appear).Google Scholar
  9. [9]
    A.R. CALDERBANK AND N.J. SLOANE, Inequalities for covering codes, preprint.Google Scholar
  10. [10]
    G.D. COHEN, M.G. KARPOVSKY, H.F. MATTSON, JR. AND J.R. SCHATZ, Covering Radius-Survey and Recent Results, IEEE Trans. Information Theory, IT 31 (1985), pp. 328–343.Google Scholar
  11. [11]
    G.D. COHEN, A.C. LOBSTEIN AND N.J.A. SLOANE, Further Results on the Covering Radius of Codes, IEEE Trans. Information Theory, IT 32 (1986), pp. 680–694.Google Scholar
  12. [12]
    D.E. DOWNEY AND N.J.A. SLOANE, The covering radius of cyclic codes of length up to 31, IEEE Trans. Information Theory, IT 31 (1985), pp. 446–447.Google Scholar
  13. [13]
    H. FERNANDES AND E. RECHTSCHAFFEN, The Football Pool Problem for 7 and 8 Matches, J. Combinatorial Theory, A35 (1985), pp. 109–114.Google Scholar
  14. [14]
    R.L. GRAHAM AND N.J.A. SLOANE, On the Covering Radius of Codes, IEEE Trans. Information Theory, IT 31 (1985), pp. 385–401.Google Scholar
  15. [15]
    M.W. VAN DER HAM, Simulated Annealing applied in Coding Theory, Master's Thesis, Eindhoven University of Technology, (1988).Google Scholar
  16. [16]
    H.O. HÄMÄLÄINEN, Upper bounds for football pool problems and mixed covering codes, preprint.Google Scholar
  17. [17]
    I.S. HONKALA, Lower Bounds for Binary Covering Codes, IEEE Trans. Information Theory, IT 34 (1988), pp. 326–329.Google Scholar
  18. [18]
    I.S. HONKALA AND H.O. HÄMÄLÄINEN, A New Family of Covering Codes, IEEE Trans. Information Theory (to appear).Google Scholar
  19. [19]
    H. JANWA, Some New Upper Bounds on the Covering Radius of Codes, IEEE Trans. Information Theory (to appear).Google Scholar
  20. [20]
    H. JANWA AND H.F. MATTSON, JR., Covering Radii of Even Subcodes of t-dense Codes, Proc. AAECC 3, Grenoble, Lect. Notes Comput. Sci. 229 (1986), pp. 120–130.Google Scholar
  21. [21]
    H.J.L. KAMPS AND J.H. VAN LINT, The Football Pool Problem for 5 Matches, J. Combinatorial Theory, A3 (1967), pp. 315–325.Google Scholar
  22. [22]
    —, A covering problem, Colloquia Mathematica Societatis János Bolyai, 4 (1970), pp. 679–685.Google Scholar
  23. [23]
    K.E. KILBY AND N.J.A. SLOANE, On the Covering Radius Problem for Codes I, II, SIAM J. Algebraic and Discrete Methods, 8 (1987), pp. 604–627.Google Scholar
  24. [24]
    S. KIRKPATRICK, C.D. GELATT, JR. AND M.P. VECHI, Optimization by Simulated Annealing, Science 220 (1983), pp. 671–680.Google Scholar
  25. [25]
    P.J.M. VAN LAARHOVEN AND E.H.L. AARTS, Simulated Annealing: Theory and Applications, D. Reidel Publishing Company, Kluwer Academic Publishers, Dordrecht, The Netherlands, (1987).Google Scholar
  26. [26]
    P.J.M. VAN LAARHOVEN, E.H.L. AARTS, J.H. VAN LINT AND L.T. WILLE, New Upper Bounds for the Football Pool Problem for 6, 7 and 8 Matches, J. Combinatorial Theory (to appear).Google Scholar
  27. [27]
    J.H. VAN LINT, JR, Covering Radius Problems, Master's Thesis, Eindhoven University of Technology, (1988).Google Scholar
  28. [28]
    H.F. MATTSON, JR., An Improved Upper Bound on Covering Radius, Lecture Notes in Computer Science, 228 (1986), pp. 90–106.Google Scholar
  29. [29]
    N. METROPOLIS, A. ROSENBLUTH, M. ROSENBLUTH, A. TELLER AND E. TELLER, Equation of State Calculations by Fast Computer Machines, J. of Chem. Physics, 21 (19853), pp. 1087–1092.Google Scholar
  30. [30]
    J. PACH AND J. SPENCER, Explicit codes with low covering radius, IEEE Trans. Information Theory (to appear).Google Scholar
  31. [31]
    J. SIMONIS, The minimal covering radius t[15, 6] of a 6-dimensional binary linear code of length 15 is equal to 4, IEEE Trans. Information Theory (to appear).Google Scholar
  32. [32]
    A.N. SKOROBOGATOV, On the covering radius of BCH codes, Proc. Third Int. Workshop on Information Theory, Sochi (1987), pp. 308–309.Google Scholar
  33. [33]
    N.J.A. SLOANE, A new approach to the covering radius of codes, J. Combinatorial Theory, A24 (1986), pp. 61–86.Google Scholar
  34. [34]
    E. VELIKOVA, Bounds on covering radius of linear codes, Comptes Rendus de l'Academie bulgare des Sciences, 41 (1988), pp. 13–16.Google Scholar
  35. [35]
    E.W. WEBER, On the Football Pool Problem for 6 Matches: A New Upper Bound, J. Combinatorial Theory, A35 (1983), pp. 109–114.Google Scholar
  36. [36]
    G.J.M. VAN WEE, Improved Sphere Bounds on the Covering Radius of Codes, IEEE Trans. Information Theory, IT 34 (1988), pp. 237–245.Google Scholar
  37. [37]
    L.T. WILLE, The Football Pool Problem for 6 Matches: A New Upper Bound Obtained by Simulated Annealing, J. Combinatorial Theory, A45 (1987), pp. 171–177.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • J. H. van Lint
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyEindhovenNetherlands

Personalised recommendations