Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric

A new metric, called the class metric, has already been introduced by Sharma and Kaushik. In this paper, we obtain extensions of Hamming sphere packing and Varsharmov-Gilbert-Sacks bounds to codes correcting random errors and bursts with weight constraints under the class metric.