1. Bambah, R.P., Joshi, D.D., and Luthar, I.S. 1961. Some lower bounds on the number of code points in a minimum distance binary codes I,II.Inform. and Contr., 4:313?323.
2. Barg, A.M., and Litsyn, S.N. 1991. DC-constrained codes from Hadamard matrices.IEEE Trans. Inform. Theory, IT-37, 3, Pt. 2:801?807.
3. Bassalygo, L.A. 1966. On separable comma-free codes.Problemy Peredachi Inform., 2:78?79, andProbl. Inform. Trans. 2:52?53.
4. Bateman, P.T., Chowla, S., and Erdös, P. 1950. Remarks on the size ofL(1, ?).Publ. Mat. Debrecen, 1:165?182.
5. Berlekamp, E.R. 1968.Algebraic Coding Theory. New York: McGraw Hill.