Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. R.P.Bambah,D.D.Joshi, and I.S.Luthar. Some lower bounds on the number of code points in a minimum distance binary codes I,II. Inform. and Contr., 4,4 (December 1961), 313–323.
2. L.A.Bassalygo. On separable comma-free codes. Problemy Peredachi Inform., 2,4 (1966), 78–79, and Probl. Inform. Trans.
2 (1966), 52–53.
3. A.M.Barg and S.N.Litsyn DC-constrained codes from Hadamard matrices. IEEE Trans. Inform. Theory, 37, 3, Pt.2 (May 1991), 801–807.
4. E.R.Berlecamp. Algebraic Coding Theory. McGraw Hill, N.Y. et al., 1968.
5. S.Golomb, W.Gordon, and L.Welch. Comma-free codes. Canad. J. Math., 10, 2 (1958), 202–209.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献