Abstract
In this paper, we examine greedily generated self-orthogonal codes. Weshow that they are linear, and discuss several properties whichthey possess. We also look at specific examples of these codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. A. Brualdi and V. Pless, Greedy codes, JCT(A), Vol. 64 (1993) pp. 10–30.
J. H. Conway and N. J. A. Sloane, Lexicographic codes: error correcting codes from game theory, IEEE Trans. Inform. Theory, Vol. IT-32 (1986) pp. 337–348.
D. Fon-Der-Flaass, A Note on greedy codes, to appear.
V.I. Levenstein, A Class of systematic codes, Dokl. Akad. Nauk, Vol. 1 (1960) pp. 368–371.
L. Monroe, Binary greedy codes, to appear in Congressus Numerantium, Vol. 100-104.
N. J. A. Sloane, Table of lower bounds on dmax (n, k) for linear codes over fields of order 3, The Handbook of Coding Theory (R. A. Brualdi, C. Huffman, and V. Pless, eds.), Elsevier Science Publishers, to appear.
N. J. A. Sloane, Table of lower bounds on dmax. (n, k) for linear codes over fields of order 4, The Handbook of Coding Theory (R. A. Brualdi, C. Huffman, and V. Pless, eds.), Elsevier Science Publishers, to appear.
A. J. van Zanten, Lexicodes over fields of characteristic 2, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Monroe, L. Self-Orthogonal Greedy Codes. Designs, Codes and Cryptography 9, 79–83 (1996). https://doi.org/10.1023/A:1027394008247
Issue Date:
DOI: https://doi.org/10.1023/A:1027394008247