Abstract
We derive the limiting efficiencies of dc-constrained codes. Given bounds on the running digital sum (RDS), the best possible coding efficiency , for a K-ary transmission alphabet, is log2 max/l...

This publication has 3 references indexed in Scilit: