Skip to main content
SpringerLink
Log in

Quasideterminant Characterization of MDS Group Codes over Abelian Groups

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Separable) linear codes over finite fields is generalized to MDS group codes over abelian groups, using the notion of quasideterminants defined for matrices over non-commutative rings.

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

Access this article

Log in via an institution

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. E. Biglieri and M. Elia, Construction of linear block codes over groups, IEEE International Symposium on Information Theory, San Antonio, Texas (1993).

  2. G. D. Forney, Jr., Geometrically uniform codes, IEEE Transactions on Information Theory, Vol. IT-37, No.5 (1991) pp. 1241-1260.

    MathSciNet  Google Scholar 

  3. G. D. Forney, Jr., On the Hamming distance property of group codes, IEEE Transactions Information Theory, Vol. IT-38, No.6 (1992) pp. 1797-1801.

    MathSciNet  Google Scholar 

  4. I. M. Gel'fand and V. S. Retakh, Determinants of matrices over noncommutative rings, Funktsional'nyi Analiz i Ego Prilozheniya, Vol. 25, No.2 (April-June 1991) pp. 13-25.

    Google Scholar 

  5. I. M. Gel'fand and V. S. Retakh, A theory of noncommutative determinants and characteristic functions of graphs, Funktsional'nyi Analiz i Ego Prilozheniya, Vol. 26, No.4 (Oct.-Dec.) pp. 1-20.

  6. James R. Clay, Near Rings, Geneses and Applications, Oxford University Press (1992).

  7. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland (1977).

  8. B. R. McDonald, Finite Rings with Identity, Marcel Dekker, New York (1974).

    Google Scholar 

  9. Singleton, Maximum distance q-ary codes, IEEE Transactions on Information Theory, Vol. IT-10 (1964) pp. 116-118.

    MathSciNet  Google Scholar 

  10. T. W. Hungerford, Algebra, Chapter VII, Springer-Verlag (1989).

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical Engineering, Indian Institute of Technology, Delhi, Hauz Khas, New Delhi, 110 016, India

    A. A. Zain & B. Sundar Rajan

Authors
  1. A. A. Zain
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Sundar Rajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zain, A.A., Rajan, B.S. Quasideterminant Characterization of MDS Group Codes over Abelian Groups. Designs, Codes and Cryptography 13, 313–330 (1998). https://doi.org/10.1023/A:1008214310938

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008214310938

Search

Navigation