Resumen
Super-simple cyclic designs are useful on constructing codes and designs such as superimposed codes, perfect hash families and optical orthogonal codes with index two. In this paper, we show that there exists a super-simple cyclic (v,4,?) for 7?v?41 and all admissible ? with two definite exceptions of (v,?)=(9,3),(13,5) and one possible exception of (v,?)=(39,18). Some useful algorithms are explained for computer search and new designs are displayed.