Cyclic unequal error protection codes constructed from cyclic codes of composite length
نویسندگان
چکیده
The unequal error correction capabilities of binary cyclic codes of composite length aye investigated. Under certain conditions, direct sums of concatenated codes have unequal error correction capabilities. By a modified Hartmann and Tzeng algorithm, it is shown that a binary cyclic code of composite length is equivalent to the direct sum of concatenated codes. With this, some binary cyclic unequal error protection (UEP) codes are constructed. Finally, a special class of two-level UEP cyclic direct-sum codes is presented.
منابع مشابه
On linear unequal error protection codes
It is possible for a linear block code to provide more protection against errors for selected mess~ge positions than is guaranteed by the minimum distance of the code. Codes having this property are called Linear Unequal Error Protection (LUEP) codes. In this report the optimal encoding of LUEP codes is discussed and bounds on the length of a code that ensures a given unequal error protection a...
متن کاملUnequal Error Protection for Joint Source-channel Coding Schemes
A joint source-channel coding scheme (JSCCS) used in applications, like sending images, voice, music etc. over internet/ wireless networks, involves source coding to compress the information and channel coding to detect/ correct errors, introduced by the channel. In this paper, we investigate the unequal error protection (UEP) capability of a class of low-density parity-check (LDPC) codes in a ...
متن کاملOn the Unequal Error Protection Capability of a q-ary Image of a Low-Rate q-ary Cyclic Code
An algorithm for finding the unequal error protection (UEP) capability of a q-ary image of a low-rate qm-ary cyclic code is presented by combining its concatenated structure with the UEP capability of concatenated codes. The results are independent of a choice of a basis to be used for expanding an element over GF(qm) into GF(q). A table of the UEP capability of binary images of low-rate Reed-S...
متن کاملSome results on arithmetic codes of composite length
In this paper we present a new upper bound on the minimum distance of binary cyclic arithmetic codes of composite length. Two new classes of binary cyclic arithmetic codes of composite length are introduced. The error correction capability of these codes are discussed and in some cases the actual minimum distance is found. Decoding algorithms based on majority-logic decision are proposed for th...
متن کاملOn cyclic codes of composite length and the minimal distance
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and dimension over the same finite field. However, not much is known about these codes. In this paper we explain some of the mysteries of the numerical data by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 1988