A note on non-minimal abelian codes

期刊论文
发表日期：

2025年6月11日

查看全文

Emre Okuyucu,
İpek Tuvay

摘要

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 $p^n$ $p^{n}$ , where p is a prime number, are more convenient than any cyclic code of the same length where $n \ge 2$ $n \geq 2$ . This generalizes a result of Polcino Milies and de Melo which compares the convenience of the non-cyclic abelian and cyclic codes of length $p^2$ $p^{2}$ .