@article{
    HaKa04,
    author = {Haanp{\"a}{\"a}, Harri and Kaski, Petteri},
    title = "The near resolvable 2-(13,4,3) designs and thirteen-player whist tournaments",
    url = "http://dx.doi.org/10.1007/s10623-003-6738-7",
    journal = "Designs, Codes and Cryptography",
    number = "3",
    abstract = "A $v$-player whist tournament is a schedule of games, where in each round the $v$ players are partitioned into games of four players each with at most one player left over. In each game two of the players play as partners against the other two. All pairs of players must play in the same game exactly three times during the tournament; of those three times, they are to play as partners exactly once. Whist tournaments for $v$ players are known to exist for all $v\equiv 0,1\pmod 4$. The special cases of directed whist tournaments and triplewhist tournaments are known to exist for all sufficiently large $v$, but for small $v$ several open cases remain. In this paper we introduce a correspondence between near resolvable $\tdes2vk\lambda$ designs and a particular class of codes. The near resolvable $\tdes2{13}43$ designs are classified by classifying the corresponding codes with an orderly algorithm. Finally, the thirteen-player whist tournaments are enumerated starting from the near resolvable $\tdes2{13}43$ designs.",
    volume = "35",
    flags = "copy",
    year = "2005",
    keywords = "near resolvable design, whist tournament, orderly algorithm",
    pages = "271--285"
}