Essential idempotents and simplex codes
Keywords:
Group code, Essential idempotent, Simplex codeAbstract
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.
Downloads
References
S. D. Berman, Semisimple cyclic and abelian codes. II, Cybernetics 3(3) (1967) 17–23.
S. D. Berman, On the theory of group codes, Cybernetics 3(1) (1967) 25–31.
A. Bonisoli, Every equidistant linear code is a sequence of dual Hamming codes, Ars Combin. 18 (1984) 181–186.
R. A. Ferraz, M. Guerreiro, and C. Polcino Milies, $G$–Equivalence in group algebras and minimal abelian codes, IEEE Trans. Inform. Theory 60(1) (2014) 252–260.
R. A. Ferraz and C. Polcino Milies, Idempotents in group algebras and minimal abelian codes, Finite Fields Appl. 13(2) (2007) 382–393.
P. Grover and A. K. Bhandari, Explicit determination of certain minimal abelian codes and their duals, Asian-Eur. J. Math. 5(1) (2012) 1250002.
J. M. Jensen, The concatenated structure of cyclic and abelian codes, IEEE Trans. Inform. Theory 31(6) (1985) 788–793.
F. J. MacWilliams, Binary codes which are ideals in the group algebra of an abelian group, Bell Syst. Tech. J. 49(6) (1970) 987–1011.
R. L. Miller, Minimal codes in abelian group algebras, J. Combin. Theory Ser. A 26(2) (1979) 166–178.
C. Polcino Milies and F. D. de Melo, On cyclic and abelian codes, IEEE Trans. Inform. Theory 59(11) (2013) 7314–7319.
C. Polcino Milies and S. K. Sehgal, An Introduction to Group Rings, Algebras and Applications, vol. 1, Kluwer Academic Publishers, Dordrecht, 2002.
A. Poli, Construction of primitive idempotents for $n$–variable codes, in: Applied Algebra, Algorithmics and Error-Correcting Codes (AAECC-3), Lecture Notes in Computer Science, vol. 229, Springer, Berlin, Heidelberg, 1986, pp. 248–258.
R. E. Sabin, On minimum distance bounds for abelian codes, Appl. Algebra Engrg. Comm. Comput. 3(3) (1992) 193–197.
R. E. Sabin, On determining all codes in semi–simple group rings, in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-10), Lecture Notes in Computer Science, vol. 673, Springer, Berlin, Heidelberg, 1993, pp. 279–290.
R. E. Sabin and S. J. Lomonaco, Jr., Metacyclic error–correcting codes, Appl. Algebra Engrg. Comm. Comput. 6(3) (1995) 191–210.
