Funder
Hrvatska Zaklada za Znanost
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference37 articles.
1. Bailey R.F., Hawtin D.R.: On the classification of binary completely transitive codes with almost-simple top-group. arXiv:2012.08436 (2020).
2. Bamberg J., Betten A., Cara P., De Beule J., Lavrauw M., Neunhöffer M.: FinInG—Finite Incidence Geometry, Version 1.4.1 (2018).
3. Bamberg J., Penttila T.: A classification of transitive ovoids, spreads, and m-systems of polar spaces. Forum Math. 21(2), 181–216 (2009).
4. Biggs N.: Perfect codes in graphs. J. Comb. Theory Ser. B 15(3), 289–296 (1973).
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
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Neighbour-transitive codes in Kneser graphs;Journal of Combinatorial Theory, Series A;2024-05