The results of this paper are concerned with the multi-covering radius, a generalization of covering radius, of Rank Distance (RD) codes. This leads to greater understanding of RD codes and their distance properties. Results on multi-covering radii of RD codes under various constructions are given by varying the parameters. Some bounds are established. A relationship between multi-covering radi...

2 Glivenko-Cantelli Classes 5 2.1 The classical approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1.1 The symmetrization procedure . . . . . . . . . . . . . . . . . . . . . 7 2.1.2 Covering numbers and complexity estimates . . . . . . . . . . . . . . 9 2.2 Combinatorial parameters and covering numbers . . . . . . . . . . . . . . . 12 2.2.1 Uniform entropy and the VC dimen...

Mixed packing-covering linear programs capture a simple but expressive subclass of linear programs. They commonly arise as linear programming relaxations of a number important combinatorial problems, including various network design and generalized matching problems. In this paper, we propose an efficient distributed approximation algorithm for solving mixed packing-covering problems which requ...