Preview
Unable to display preview. Download preview PDF.
References
R. A. Brualdi and V. Pless, Greedy codes, preprint.
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.
V. I. Levenshtein, A class of systematic codes. Dokl. Akad. Nauk SSSR131 (1960), 1011–1014 (Russian); translated as Soviet Math. Dokl.1, 368–371.
T. Verhoeff, An updated table for minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory, vol IT-33, 1987, 665–680.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pless, V. (1992). Remarks on greedy codes. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034341
Download citation
DOI: https://doi.org/10.1007/BFb0034341
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55130-0
Online ISBN: 978-3-540-46739-7
eBook Packages: Springer Book Archive