Covering radius and dual distance

Designs, Codes and Cryptography

Volumn 1, Issue 1, 1991, Pages 31-46

  Tietavainen A ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041010738     PISSN: 09251022     EISSN: 15737586     Source Type: Journal    
DOI: 10.1007/BF00123957     Document Type: Article

References (21)

1. Linear programming bounds for tree codes
2. Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance
3. On the covering radius of extremal self-dual codes
4. Four fundamental parameters of a code and their combinatorial significance
5. On the covering radius of binary codes
6. Bounds on the maximum size of a code with limited scalar product modulus
7. Bounds for packings of metric spaces and some of their applications
8. An upper bound for self-dual codes
9. Weight congruences for p-ary cyclic codes
10. Asymptotic bounds on the covering radius of binary codes
11. Generalization of the Norse bound to codes of higher strength
12. An upper bound on the covering radius as a function of the dual distance
13. New bounds on cyclic codes from algebraic curves
14. On the dual distance for BCH codes