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

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

Reference:

Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. Journal of Combinatorial Theory, Series A, 113(4):703–711, 2006.

Suggested BibTeX entry:

@article{GrHK06,
    author = {Malcolm Greig and Harri Haanp{\"a}{\"a} and Petteri Kaski},
    journal = {Journal of Combinatorial Theory, Series A},
    number = {4},
    pages = {703--711},
    title = {On the Coexistence of Conference Matrices and Near Resolvable 2-(2k+1, k, k-1) Designs},
    volume = {113},
    year = {2006},
}

See dx.doi.org ...

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