TCS / Research / Publications / There Exists No (15,5,4) RBIBD
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

There Exists No (15,5,4) RBIBD

Reference:

Petteri Kaski and Patric R. J. Östergård. There exists no (15,5,4) RBIBD. Journal of Combinatorial Designs, 9(5):357–362, 2001.

Abstract:

An code is a -ary code of length , cardinality , and minimum distance . We show that there exists no resolvable balanced incomplete block design (RBIBD) by showing that there exists no (equidistant) code. This is accomplished by an exhaustive computer search using an orderly algorithm combined with a maximum clique algorithm.

Keywords:

equidistant code, maximum clique, orderly algorithm, resolvable balanced incomplete block design

Suggested BibTeX entry:

@article{KaOs01,
    author = {Petteri Kaski and Patric R. J. {\"O}sterg{\aa}rd},
    journal = {Journal of Combinatorial Designs},
    number = {5},
    pages = {357--362},
    title = {There Exists No (15,5,4) {R}{B}{I}{B}{D}},
    volume = {9},
    year = {2001},
}

See dx.doi.org ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.