Systematic Polar Coding
نویسندگان
چکیده
منابع مشابه
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...
متن کاملEfficient Quantum Polar Coding
Polar coding, introduced 2008 by Arıkan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channel...
متن کاملEnergy-adaptive Polar Coding: Trading Off Reliability and Decoding Energy with Adaptive Polar Coding Circuits
To be considered for the 2017 IEEE Jack Keil Wolf ISIT Student Paper Award. Recent works have found that using a long and complicated error correcting code (ECC) designed for the worst-case error probability requirement wastes excessive total system energy (transmit + circuit energy) when the error probability requirement is much higher than the worst case. We propose a novel adaptive polar cod...
متن کاملPolar codes for distributed hierarchical source coding
Hierarchical source coding, also known as successive refinement of information, was introduced by Koshelev [1,2] and Equitz and Cover [3]. This problem is concerned with the construction of a source code for a discrete memoryless source X with respect to a given distortion measure d1 that can be further refined to represent the same source within another distortion measure d2 so that both repre...
متن کاملEnumerative Coding for Line Polar Grassmannians
Codes arising from Grassmannians have been widely investigated, both as generalization of Reed–Muller codes and for applications to network coding. Recently we introduced some new codes, arising from Polar Grassmannians, namely the set of all subspaces of a vector space F q which are totally singular with respect to a given non-degenerate quadratic form. The aim of the present paper is to prese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2011
ISSN: 1089-7798
DOI: 10.1109/lcomm.2011.061611.110862