Advertisement

Remarks on greedy codes

  • Vera Pless
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 573)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. A. Brualdi and V. Pless, Greedy codes, preprint.Google Scholar
  2. 2.
    J. H. Conway and N. J. A. Sloane, Lexicographic codes; Error-correcting codes from game theory IEEE Trans. Inform. Theory, vol IT-32, 1986, 337–348.CrossRefGoogle Scholar
  3. 3.
    V. I. Levenshtein, A class of systematic codes. Dokl. Akad. Nauk SSSR131 (1960), 1011–1014 (Russian); translated as Soviet Math. Dokl.1, 368–371.Google Scholar
  4. 4.
    T. Verhoeff, An updated table for minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory, vol IT-33, 1987, 665–680.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Vera Pless
    • 1
  1. 1.Mathematics DepartmentUniversity of Illinois at ChicagoChicago

Personalised recommendations