Skip to main content
Log in

Abstract

Error-correcting codes which are ideals in group rings where the underlying group is metacyclic and non-abelian are examined. Such a groupG(M, N,R) is the extension of a finite cyclic group ℤM by a finite cyclic group ℤ N and has a presentation of the form (S, T:S M =1,T N =1, T· S=S R ·T) where gcd(M, R)=1, R N =1 modM, R ≠ 1. Group rings that are semi-simple, i.e., where the characteristic of the field does not divide the order of the group, are considered. In all cases, the field of the group ring is of characteristic 2, and the order ofG is odd.

Algebraic analysis of the structure of the group ring yields a unique direct sum decomposition ofFG(M, N, R) to minimal two-sided ideals (central codes). In every case, such codes are found to be combinatorically equivalent to abelian codes and of minimum distance that is not particularly desirable. Certain minimal central codes decompose to a direct sum ofN minimal left ideals (left codes). This direct sum is not unique. A technique to vary the decomposition is described. p]Metacyclic codes that are one-sided ideals were found to display higher minimum distances than abelian codes of comparable length and dimension. In several cases, codes were found which have minimum distances equal to that of the best known linear block codes of the same length and dimension.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

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)

    Google Scholar 

  2. Camion, P.: Abelian codes. MRC Tech. Sum. Rep 1059, University of Wisconsin, Madison 1971

    Google Scholar 

  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)

    Google Scholar 

  4. Curtis, C. W., Reiner, I.: Representation theory of finite groups and associative algebras. New York: Interscience 1962

    Google Scholar 

  5. Keown, R.: An introduction to group representation theory. New York: Academic Press 1975

    Google Scholar 

  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

    Google Scholar 

  9. MacWilliams, F. J., Sloane, N. J. A.: The theory of error-correcting codes. New York: North-Holland 1977

    Google Scholar 

  10. Peterson, W. W., Weldon, F. J., Jr.: Error-correcting codes. Cambridge, Ma: MIT Press 1986

    Google Scholar 

  11. Piret, P.: Good block codes derived from cyclic codes. Electronics Letters10, 391–392 (1974)

    Google Scholar 

  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

    Google Scholar 

  13. Serre, J.-P.: Linear representations of finite groups. Berlin, Heidelberg, New York: Springer 1977

    Google Scholar 

  14. Tucker, P. A.: On the reduction of induced representations of finite groups. Am. J. Math.84, 400–420 (1962)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sabin, R.E., Lomonaco, S.J. Metacyclic error-correcting codes. AAECC 6, 191–210 (1995). https://doi.org/10.1007/BF01195337

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01195337

Keywords

Navigation