Advertisement

Unsolved Problems Related to the Covering Radius of Codes

Chapter

Abstract

Some of the principal unsolved problems related to the covering radius of codes are described. For example, although it is almost 20 years since it was built, Elwyn Berlekamp’s light-bulb game is still unsolved.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    T.A. Brown and J.H. Spencer, “Minimization of ±1 Matrices Under Line Shifts,” Colloq. Math. 23, pp. 165–171 (1971).MathSciNetzbMATHGoogle Scholar
  2. [2]
    G.D. Cohen, M.G. Karpovsky, H.F. Mattson, Jr., and J.R. Schatz, “Covering Radius-Survey and Recent Results,” IEEE Trans. Inf. Theory, IT-31, pp. 328–343 (1985).MathSciNetCrossRefGoogle Scholar
  3. [3]
    G.D. Cohen, A.C. Lobstein, and N.J.A. Sloane, “Further Results on the Covering Radius of Codes,” IEEE Trans. Inf. Theory, to appear.Google Scholar
  4. [4]
    D.E. Downie and N.J.A Sloane, “The Covering Radius of Cyclic Codes of Length up to 31,” IEEE Trans. Inf. Theory, IT-31, pp. 446–447 (1985).MathSciNetCrossRefGoogle Scholar
  5. [5]
    Y. Gordon and H.S. Witsenhausen, “On Extensions of the Gale-Berlekamp Switching Problem and Constant of l p Spaces,” Israel J. Math., 11, pp. 216–229 (1972).MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    R.L. Graham and N.J.A. Sloane, “On the Covering Radius of Codes,” IEEE Trans. Inf. Theory, IT-31, pp. 385–401 (1985).MathSciNetCrossRefGoogle Scholar
  7. [7]
    K.E. Kilby and N.J.A. Sloane, “On the Covering Radius Problem for Codes, I and II,” submitted to SIAM J. Algeb. Discrete Methods.Google Scholar
  8. [8]
    F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 2nd printing, 1978.Google Scholar
  9. [9]
    H.F. Mattson, Jr., “An Improved Upper Bound on Covering Radius,” preprint.Google Scholar
  10. [10]
    N.J. Patterson and D.H. Wiedemann, “The Covering Radius of the (215, 16) Reed-Muller Code is at Least 16276,” IEEE Trans. Inf Theory, IT-29, pp. 354–356 (1983).MathSciNetCrossRefGoogle Scholar
  11. [11]
    W.W. Peterson and E.J. Weldon, Jr., Error-Correcting Codes, M.I.T. Press, Cambridge, MA, 2nd ed., 1972.zbMATHGoogle Scholar
  12. [12]
    O.S. Rothaus, “On Bent Functions,” J. Combinatorial Theory, 20A, pp. 300–305 (1976).MathSciNetCrossRefGoogle Scholar
  13. [13]
    N.J.A. Sloane, “A New Approach to the Covering Radius of Codes,” J. Combinatorial Theory, to appear.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1987

Authors and Affiliations

  1. 1.AT&T Bell LaboratoriesMurray HillUSA

Personalised recommendations