# zbMATH — the first resource for mathematics

Metacyclic error-correcting codes. (English) Zbl 0823.94017
The group codes are ideals of group algebras. Let $$G$$ and $$H$$ be groups of the same order, $$F$$ be a finite field, let $$FG$$ and $$FH$$ be the corresponding group rings. The combinatorial equivalence is an $$F$$ vector space isomorphism $$\gamma: FG\to FH$$ induced by a bijection $$\gamma: G\to H$$. Codes $$C1 \subseteq FG$$ and $$C2 \subseteq FH$$ are said to be combinatorially equivalent if there exists a combinatorial equivalence $$\gamma: FG\to FH$$ such that $$\gamma (C1)= C2$$.
In this paper the authors investigate the group codes when the underlying groups are metacyclic groups of odd order and $$F$$ is a field of characteristic two. Using methods of representation theory it is shown that each of these codes is combinatorially equivalent to an abelian code, and therefore they are not interesting as non-abelian codes. Certain of them contain one-sided (which are one-sided ideals) non- abelian codes which are not combinatorially equivalent and may vary in minimal distance. There are also given examples, a list of the better metacyclic codes and the algorithm to determine minimal left metacyclic codes.

##### MSC:
 94B15 Cyclic codes 20G15 Linear algebraic groups over arbitrary fields 94B65 Bounds on codes
Full Text:
##### References:
 [1] Brouwer, A. E., Verhoff, T.: An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory39, 662-677 (1993) · Zbl 0776.94017 [2] Camion, P.: Abelian codes. MRC Tech. Sum. Rep 1059, University of Wisconsin, Madison 1971 [3] Cheng, Y., Sloane, N. J. A.: Codes from symmetry groups, and a [32, 17, 8] code. SIAM J. Disc. Math.2, 28-37 (1989) · Zbl 0669.94016 [4] Curtis, C. W., Reiner, I.: Representation theory of finite groups and associative algebras. New York: Interscience 1962 · Zbl 0131.25601 [5] Keown, R.: An introduction to group representation theory. New York: Academic Press 1975 · Zbl 0325.20004 [6] Lomonaco, S. J., Jr.: Equivalent error correcting codes. Unpublished manuscript 1973 [7] Lomonaco, S. J., Jr.: Non-abelian error-correcting codes. Unpublished manuscript 1987 [8] MacWilliams, F. J.: Codes and ideals in group algebras. In: Bose, R. C., Dowling, T. A. (eds) Proc. of Conf. on Combinatorial Mathematics and Its Applications, 1967. Chapel Hill, N.C.: U. of N. C. Press 1969 · Zbl 0166.15504 [9] MacWilliams, F. J., Sloane, N. J. A.: The theory of error-correcting codes. New York: North-Holland 1977 · Zbl 0369.94008 [10] Peterson, W. W., Weldon, F. J., Jr.: Error-correcting codes. Cambridge, Ma: MIT Press 1986 [11] Piret, P.: Good block codes derived from cyclic codes. Electronics Letters10, 391-392 (1974) [12] Sabin, R. E.: On determining all codes in semi-simple group rings. In: Cohen, G. et al. (ed.) Proc. AAECC-10. Berlin, Heidelberg, New York, Springer 1993 · Zbl 0804.94017 [13] Serre, J.-P.: Linear representations of finite groups. Berlin, Heidelberg, New York: Springer 1977 [14] Tucker, P. A.: On the reduction of induced representations of finite groups. Am. J. Math.84, 400-420 (1962) · Zbl 0109.25902
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.