On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings
نویسندگان
چکیده
The ring decomposition technique of part I is extended to the case when the factors in the direct product decomposition are no longer fields but arbitrary chain rings. This includes not only the case of quasi-cyclic codes over rings but also the case of quasi-cyclic codes over fields whose co-index is no longer prime to the characteristic of the field. A new quaternary construction of the Leech lattice is derived.
منابع مشابه
Codes over a Non Chain Ring with Some Applications
An significant milestone study in coding theory recognized to be the paper written by Hammons at al. [1]. Fields are useful area for constructing codes but after the study [1] finite ring have received a great deal of attention. Most of the studies are concentrated on the case with codes over finite chain rings. However, optimal codes over nonchain rings exist (e.g see [2].) In [3], et al. stud...
متن کاملOn the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots
A trace formula for quasi-cyclic codes over rings of characteristic not coprime with the co-index is derived. The main working tool is the Generalized Discrete Fourier Transform (GDFT), which in turn relies on the Hasse derivative of polynomials. A characterization of Type II self-dual quasi-cyclic codes of singly even co-index over finite fields of even characteristic follows. Implications for...
متن کاملThe Gray Image of Codes over Finite Chain Rings
The results of J. F. Qian et al. [5] on (1 − γ)-constacyclic codes over finite chain rings of nilpotency index 2 are extended to (1 − γe)constacyclic codes over finite chain rings of arbitrary nilpotency index e+1. The Gray map is introduced for this type of rings. We prove that the Gray image of a linear (1− γe)-constacyclic code over a finite chain ring is a distance-invariant quasi-cyclic co...
متن کاملQuasi-Cyclic Codes Over Finite Chain Rings
In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we investigate the structural properties of 1-generator QC codes. Under some conditions, we discuss the enumeration of 1-generator QC codes and describe how to o...
متن کاملLDPC Convolutional Codes Based on Permutation Polynomials over Integer Rings
A novel algebraic construction technique for LDPC convolutional codes (LDPCCCs) based on permutation polynomials over integer rings is presented. The underlying elements of this construction technique are graph automorphisms and quasi-cyclic (QC) codes. The algebraic structure of the obtained LDPCCCs, their encoding and decoding are discussed. These new codes have a special structure, which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 30 شماره
صفحات -
تاریخ انتشار 2003