Skip to main content
SpringerLink
Log in

On the Structure of Linear and Cyclic Codes over a Finite Chain Ring

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

We generalise structure theorems of Calderbank and Sloane for linear and cyclic codes over ℤ pa to a finite chain ring. Our results are more detailed and do not use non-trivial results from Commutative Algebra.

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

Author information

Authors and Affiliations

  1. Algebraic Coding Research Group, Centre for Communications Research, University of Bristol, Bristol BS8 1UB, UK (e-mail: Graham.Norton@bristol.ac.uk), , , , , , GB

    Graham H. Norton

  2. Department of Mathematics, Nottingham Trent University, Nottingham NG11 8NS, UK (e-mail: Ana.Salagean@ntu.ac.uk), , , , , , GB

    Ana Sălăgean

Authors
  1. Graham H. Norton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ana Sălăgean
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: January 25, 1999; revised version: November 17, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Norton, G., Sălăgean, A. On the Structure of Linear and Cyclic Codes over a Finite Chain Ring. AAECC 10, 489–506 (2000). https://doi.org/10.1007/PL00012382

Download citation

  • Issue Date:

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

Search

Navigation