Let \(n\) and \(k\) be positive integers. An \((n,k,1)\)-Mendelsohn design is an ordered pair \((V,{\mathcal C})\) where \(V\) is the vertex set of \(D_ n\), the complete directed graph on \(n\) vertices, and \({\mathcal C}\) is a set of directed cycles (called blocks) of length \(k\) which form an arc-disjoint decomposition of \(D_ n\). An \((n,k,1)\)-Mendelsohn design is called a perfect design and denoted briefly by \((n,k,1)\)-PMD if for any \(r\), \(1\leq r\leq k-1\), and for each \((x,y)\in V\times V\) there is exactly one cycle \(c\in{\mathcal C}\) in which the (directed) distance along \(c\) from \(x\) to \(y\) is \(r\). A necessary condition for the existence of an \((n,k,1)\)-PMD is \(n(n-1)\equiv 0\pmod k\). In this paper some new techniques used in the construction of PMD’s, including constructions of the product type, are described. As an application, it is shown that the necessary condition for the existence of an \((n,5,1)\)-PMD is also sufficient, except for \(n=6\) and with at most 21 possible exceptions of \(n\) of which 286 is the largest.