Two Problems Associated with Abelian Generalizations of Reed–Muller Codes

It is shown that for semisimple Reed–Muller codes it is possible to choose the basis of the code in such a way that the number of orthogonalization steps is reduced by 1. A class of majority-decodable linear codes embedded in semisimple Reed–Muller codes is set up.