Polar Codes for Multiple Descriptions
نویسندگان
چکیده
منابع مشابه
Recursive descriptions of polar codes
Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. This description allows an easy development of the first two algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also describ...
متن کاملGaussian codes and Shannon bounds for multiple descriptions
A well known inequality due to Shannon, upper / lower bounds the rate distortion function of a real source by the rate distortion function of the Gaussian source with the same variance / entropy. We extend these bounds to multiple descriptions, a problem for which a general \single letter" solution is not known. We show that the set D X (R 1 ; R 2) of achievable marginal (d 1 ; d 2) and central...
متن کاملPolar codes for the m-user multiple access channels
Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding is o(2−N 1/2− ), where N is the block length. Although the sum capacity is achieved by this coding scheme, some points in the symmetric capacity region may not be achieved. In the case where the channel is a combinat...
متن کاملPolar Codes for the -User Multiple Access Channel
—In this paper, polar codes for the -user multiple access channel (MAC)with binary inputs are constructed. It is shown that Arikan’s polarization technique applied individually to each user transforms independent uses of an -user binary input MAC into successive uses of extremal MACs. This transformation has a number of desirable properties: 1) the “uniform sum-rate” of the original MAC is ...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2368561