EUVIMEDObjevte EUVIMED
Open access · CC BY 4.0

Essential idempotents and simplex codes

Gladys Chalom, Raul A. Ferraz, C. Polcino Milies

Journal of Algebra Combinatorics Discrete Structures and Applications · 2017-05-15 · 4 (2) · 181-188

DOI: 10.13069/jacodesmath.284931 ↗

At a glance

Journal article in Journal of Algebra Combinatorics Discrete Structures and Applications, published online on 2017-05-15. Written by Gladys Chalom and 2 co-authors. Cited 6 times so far (Crossref). The full text is freely available (open access, CC BY 4.0).

AbstraktBibliografické údajeCiteRelated studies

Abstract (original language)

We define essential idempotents in group algebras and use them to prove that every mininmal abelian non-cyclic code is a repetition code. Also we use them to prove that every minimal abelian code is equivalent to a minimal cyclic code of the same length. Finally, we show that a binary cyclic code is simplex if and only if is of length of the form $n=2^k-1$ and is generated by an essential idempotent.

Cite

APA

Chalom, G., Ferraz, R. A., & Milies, C. P. (2017). Essential idempotents and simplex codes. Journal of Algebra Combinatorics Discrete Structures and Applications, 4(2), 181-188. https://doi.org/10.13069/jacodesmath.284931

Vancouver

Chalom G, Ferraz RA, Milies CP. Essential idempotents and simplex codes. Journal of Algebra Combinatorics Discrete Structures and Applications. 2017;4(2):181-188. doi:10.13069/jacodesmath.284931

BibTeX
@article{Chalom2017,
  author = {Chalom, Gladys and Ferraz, Raul A. and Milies, C. Polcino},
  title = {Essential idempotents and simplex codes},
  journal = {Journal of Algebra Combinatorics Discrete Structures and Applications},
  year = {2017},
  volume = {4},
  number = {2},
  pages = {181--188},
  doi = {10.13069/jacodesmath.284931}
}
Start for free →