A Class of Binary Shortened Cyclic Codes for a Compound Channel

نویسنده

  • Harry T. Hsu
چکیده

In this paper, a class of shortened cyclic codes for a compound channel will be presented. This class of cyclic codes can be used for combating noises in a practical channel, where both burst errors and random errors occur. As compared with the results of a previous paper by Hsu, Kasami, and Chien (1968) (henceforward will be referred to as HKC codes), the shortened cyclic codes presented will have better rate of transmission. Besides the shortened cyclic codes presented, there is a much larger class of codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ieee Transactions on Information Theory

A class of codes, having check matrices which are the tensor products of the check matrices of nonbinary and binary codes has been described. In particular, it has been shown in detail how the error-correction, error-detection and error-location capabilities of such codes depend on the component codes. Many other variations of such codes exist in addition to those discussed in this paper. In so...

متن کامل

condition on one - dimensional attracting sets of the simplest skew product of interval maps

In the theory of codes based on the Hamming metric, three classes of codes are well known, viz. cyclic codes, shortened cyclic codes and pseudocyclic codes. The important result is that a class of linear shortened cyclic codes coincides with a class of linear pseudocyclic codes [1]. There are no similar results in the theory of rank-metric based codes. In this paper, we generalize the notion of...

متن کامل

Channel Polarization and Polar Codes

Polar coding is a new technique introduced by Arıkan [1] based on a phenomenon called channel polarization. Polar codes are appealing as an error correction method since they are proved to achieve the symmetric capacity of any B-DMC using low complexity encoders and decoders, and their block error probability is shown to decrease exponentially in the square root of the block length. In fact, tw...

متن کامل

Constructions for optimal constant weight cyclically permutable codes and difference families

A cyclically permutable code is a binary code whose codewords are cyclically distinct and have full cyclic order. An important class of these codes are the constant weight cyclically permutable codes. In a code of this class all codewords have the same weight w. These codes have many applications, including in optical code-division multiple-access communication systems and in constructing proto...

متن کامل

On Some Properties of the Bit Decoding Algorithms

|In this paper, we study certain properties of the bit decoding algorithms for the case of linear binary codes . We focus on the probability distribution function (pdf) of the bit LLR using an AWGN channel model with BPSK modulation. We prove that the pdf of the bit LLR of a speci c bit position is independent of the transmitted code-word. It is also shown that the pdf of a given bit LLR when t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Information and Control

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1971