The covering radius of extremal Self-dual code D11 and its application

IEEE Transactions on Information Theory

Volumn 43, Issue 1, 1997, Pages 316-319

  Tsai, Han Ping ^a  

^a SOOCHOW UNIVERSITY   (Taiwan)

Author keywords

Covering radius; Self dual codes; Weight enumerator

Indexed keywords

ENCODING (SYMBOLS); MATHEMATICAL MODELS;

COVERING RADIUS; SELF DUAL CODES; WEIGHT ENUMERATOR;

CODES (SYMBOLS);

EID: 0030836320     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567727     Document Type: Article

References (6)

1. E. F. Assmus, Jr., and V. S. Pless, "On the covering radius of extremal self-dual codes," IEEE Trans. Inform. Theory, vol. IT-29, pp. 359-363, May 1983.
2. R. A. Brualdi and V. S. Pless, "Orphans of the first order Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 36, pp. 399-401, Mar. 1990.
3. _, "Weight enumerators of self-dual codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1222-1225, July 1991.
4. J. H. Conway and N. J. A. Sloane, "A new upper bound on the minimal distance of self-dual codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1319-1333, Nov. 1990.
5. H. P. Tsai, "Existence of certain extremal self-dual codes," IEEE Trans. Inform. Theory, vol. 38, pp. 501-504, Mar. 1992.
6. _, "Existence of some extremal self-dual codes," IEEE Trans. Inform. Theory, vol. 38, pp. 1829-1833, Nov. 1992.