|
Organizers |
On Z4 Codes Satisfying the Chain Condition
by
Manish K. Gupta
Department of Mathematics, University of Canterbury, Private Bag 4800, Christchurch, New Zealand
The concept of chain condition was introduced by Wei and Yang for binary linear codes and later studied by many others for linear codes over finite fields. The chain condition is important in applications as more can be said about the Trellis description of those codes that satisfy the chain condition and the trellis description leads to a simple soft-decision decoding algorithm for the codes. Thus the results on chain condition are of interest in implementing these codes. The chain condition concept was investigated for codes over the ring of integers modulo ps i.e, Zps, by Gupta, Bhandari and Lal and it was shown that Z4-simplex codes of both types (alpha and beta) and the Quaternary Reed Müller code ZRM(1, m) satisfy the chain condition. In this note it is shown that various known self-dual codes over Z4 satisfy the chain condition. In this process we determine the complete weight hierarchy of several codes over Z4.
Date received: November 10, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-46.