|
|
|
|
Essential idempotents and simplex codes
|
|
|
|
|
|
|
|
نویسنده
|
chalom gladys ,ferraz raul a. ,milies c. polcino
|
|
منبع
|
journal of algebra combinatorics discrete structures and applications - 2017 - دوره : 4 - شماره : 2 - صفحه:181 -188
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Group code ,Essential idempotent ,Simplex code
|
|
آدرس
|
universidade de sao paulo, Brazil, universidade de sao paulo, Brazil, universidade de sao paulo and univeersidade federal do abc, Brazil
|
|
پست الکترونیکی
|
polcino@ime.usp.br
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|