Abstract
Using the linear programming approach and the concept of weighted coverings we derive new upper bounds on the covering radius of codes with a given cardinality and a given dual distance.
| Original language | English |
|---|---|
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: 27 Jun 1994 → 1 Jul 1994 |
Conference
| Conference | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 27/06/94 → 1/07/94 |