arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.5699cs.ITmath.IT
收藏

长度为$p^m q^n$的极小二元阿贝尔码

Minimal Binary Abelian Codes of length $p^m q^n$

Gladys Chalom, Raul Antônio Ferraz, Marinês Guerreiro, César Polcino Milies

摘要:

本文考虑二元交换码的长度为$p^m q^n$,其中$p$和$q$在某些限制性假设下是素有理整数.在这种情况下,我们确定生成最小码的幂等元以及这些权重的相应权重或边界。我们给出的例子表明,这些界限达到在某些情况下。

英文摘要:

We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or bounds of these weights. We give examples showing that these bounds are attained in some cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑