@article{
    KaOs01,
    author = {Kaski, Petteri and {\"O}sterg{\aa}rd, Patric R. J.},
    title = "There Exists No (15,5,4) {R}{B}{I}{B}{D}",
    url = "http://dx.doi.org/10.1002/jcd.1016",
    journal = "Journal of Combinatorial Designs",
    number = "5",
    abstract = "An $(n,M,d)_q$ code is a $q$-ary code of length $n$, cardinality $M$, and minimum distance $d$. We show that there exists no $(15,5,4)$ resolvable balanced incomplete block design (RBIBD) by showing that there exists no (equidistant) $(14,15,10)_3$ code. This is accomplished by an exhaustive computer search using an orderly algorithm combined with a maximum clique algorithm.",
    volume = "9",
    year = "2001",
    keywords = "equidistant code, maximum clique, orderly algorithm, resolvable balanced incomplete block design",
    pages = "357--362"
}