The asymptotic probability distribution of the relative distance of additive quantum codes

For given information rate R, it is proved as n tends to infinite, that almost all additive 〚n,n⋅R〛 quantum codes (pure and impure) are the codes with their relative distance tending to h−1(1−R), where is an entropy function.