![]() | ![]() |
| 2010 | ||
|---|---|---|
| 2 | John Arhin: Every SOMA(n-2, n) is Trojan. Discrete Mathematics 310(2): 303-311 (2010) | |
| 2007 | ||
| 1 | John Arhin: On the structure of 1-designs with at most two block intersection numbers. Des. Codes Cryptography 43(2-3): 103-114 (2007) | |
Data released under the ODC-BY 1.0 license — See also our legal information page