TCS / Research / Publications / On the Existence of Conference Matrices and Near Resolvable 2-(2k+1,k,k-1) Designs
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

On the Existence of Conference Matrices and Near Resolvable 2-(2k+1,k,k-1) Designs

Reference:

Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the existence of conference matrices and near resolvable 2-(2k+1,k,k-1) designs. In Lars Døvling Andersen and Olav Geil, editors, Proceedings of the 8th Nordic Combinatorial Conference, pages 65–69, Aalborg, Denmark, October 2004. Department of Mathematical Sciences, Aalborg University. Extended summary (unrefereed).

Suggested BibTeX entry:

@inproceedings{GrHK04,
    address = {Aalborg, Denmark},
    author = {Malcolm Greig and Harri Haanp{\"a}{\"a} and Petteri Kaski},
    booktitle = {Proceedings of the 8th Nordic Combinatorial Conference},
    editor = {Lars D{\o}vling Andersen and Olav Geil},
    month = {October},
    note = {Extended summary (unrefereed)},
    organization = {Department of Mathematical Sciences, Aalborg University},
    pages = {65--69},
    title = {On the Existence of Conference Matrices and Near Resolvable {2-(2k+1,k,k-1)} Designs},
    year = {2004},
}

This work is not available online here.

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