We provide algorithms to construct minimal left group codes. These are based on results describing 
a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple 
finite group algebra $FG$ for a large class of groups $G$.