Self-orthogonal greedy codes

Designs, Codes, and Cryptography

Volumn 9, Issue 1, 1996, Pages 79-83

  Monroe, Laura ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Greedy codes; Self orthogonal codes

Indexed keywords

EID: 0242374845     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1027394008247     Document Type: Article

References (8)

1. R. A. Brualdi and V. Pless, Greedy codes, JCT(A), Vol. 64 (1993) pp. 10-30.
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) pp. 337-348.
3. D. Fon-Der-Flaass, A Note on greedy codes, to appear.
4. V.I. Levenstein, A Class of systematic codes, Dokl. Akad. Nauk, Vol. 1 (1960) pp. 368-371.
5. L. Monroe, Binary greedy codes, to appear in Congressus Numerantium, Vol. 100-104.
6. 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.
7. 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.
8. A. J. van Zanten, Lexicodes over fields of characteristic 2, to appear.