Upper bounds and Hamming spheres under the DC constraint

Upper bounds on the rate of codes in DC-constrained spaces are derived for imbalances 3, 4, and 5. The new bounds are based on the identification and size calculation of the minimal Hamming spheres. A new combination of the Hamming and Plotkin (1960) bounds for constrained spaces is obtained.<
>