EUVIMEDEUVIMED entdecken
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 · 15.05.2017 · 4 (2) · 181-188

DOI: 10.13069/jacodesmath.284931 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algebra Combinatorics Discrete Structures and Applications, online erschienen am 15.05.2017. Verfasst von Gladys Chalom und 2 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

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}
}
Kostenlos starten →