Polar Code Constructions Based on LLR Evolution

نویسندگان
چکیده

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

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

منابع مشابه

Code Constructions based on Reed-Solomon Codes

Reed–Solomon codes are a well–studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size q of the underlying field Fq. In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed.

متن کامل

On cyclotomic cosets and code constructions

New properties of q-ary cyclotomic cosets modulo n = qm − 1, where q ≥ 3 is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of classical cyclic codes can be computed. As an application, new families of nonbinary Calderbank-Shor-Steane (CSS) quantum codes as well as new families of convolutional ...

متن کامل

Categorical Code Constructions

We study categories of codes and precodes. The objects in these categories capture the encoding and decoding process of error control codes, source codes, or cryptographic codes. We show that these categories are complete and cocomplete. This gives a wealth of new code constructions.

متن کامل

Optimal Subsystem Code Constructions

In this paper, a generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. Furthermore, a simple construction of pure MDS subsystem codes is obtained...

متن کامل

A Comparative Study of Polar Code Constructions for the AWGN Channel

We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects K best among N possible polar bit-channels at the design signal-to-noise-ratio (design-SNR) in terms of bit error rate (BER). Optimal polar code construction is hard and therefore many suboptimal polar c...

متن کامل

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


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

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2017

ISSN: 1089-7798

DOI: 10.1109/lcomm.2017.2656126