We construct some codes, designs and graphs that have the first or second Janko group, or , respectively, acting as an automorphism group. We show computationally that the full automorphism group of the design or graph in each case is , or , the extension of by its outer automorphism, and we show that for some of the codes the same is true.