A note on non-minimal abelian codes

In this paper, we compute the minimum weight of some particular non-cyclic codes which is a direct sum of two minimal codes. Then we show that these non-cyclic abelian codes of length pn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p<^>n$$\end{document}, where p is a prime number, are more convenient than any cyclic code of the same length where n >= 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n \ge 2$$\end{document}. This generalizes a result of Polcino Milies and de Melo which compares the convenience of the non-cyclic abelian and cyclic codes of length p2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p<^>2$$\end{document}.