Author:
Gillespie Neil I.,Giudici Michael,Hawtin Daniel R.,Praeger Cheryl E.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference33 articles.
1. Best M.R., Brouwer A.E., Macwilliams F.J., Odlyzko A.M., Sloane N.J.A.: Bounds for binary codes of length less than 25. IEEE Trans. Inf. Theory 24, 81–93 (1978).
2. Bochert A.: Ueber die zahl der verschiedenen werthe, die eine function gegebener buchstaben durch vertauschung derselben erlangen kann. Math. Ann. 33(4), 584–590 (1889).
3. Borges J., Rifà J.: On the nonexistence of completely transitive codes. IEEE Trans. Inf. Theory 46(1), 279–280 (2000).
4. Borges J., Rifà J.: On linear completely regular codes with covering radius $$\rho =1$$ ρ = 1 . Construction and classification. CoRR http://www.abs/0906.0550 , (2009).
5. Borges J., Rifà J., Zinoviev V.A.: Nonexistence of completely transitive codes with error-correcting capability e > 3. IEEE Trans. Inf. Theory 47(4), 1619–1621 (2001).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献