Minimal Binary Abelian Codes of length $p^m q^n$
Information Theory
2012-05-28 v1 math.IT
Abstract
We consider binary abelian codes of length , where and 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.
Keywords
Cite
@article{arxiv.1205.5699,
title = {Minimal Binary Abelian Codes of length $p^m q^n$},
author = {Gladys Chalom and Raul Antônio Ferraz and Marinês Guerreiro and César Polcino Milies},
journal= {arXiv preprint arXiv:1205.5699},
year = {2012}
}
Comments
8 pages, contents partially presented at the Groups, Rings and Group Rings Conferences held in Ubatuba-SP (Brasil) and Edmonton-AL (Canada)