Polar Codes with Higher-Order Memory
نویسندگان
چکیده
منابع مشابه
Polar Codes With Higher-Order Memory
We introduce the design of a set of code sequences tC n : n ě 1,m ě 1u, with memory order m and code-length N “ Opφq, where φ P p1, 2s is the largest real root of the polynomial equation F pm, ρq “ ρm ́ρm ́1 ́1 and φ is decreasing in m. tC n u is based on the channel polarization idea, where tC n u coincides with the polar codes presented by Arıkan in [1] and can be encoded and decoded with comple...
متن کاملIntersections of Golay codes with higher order Kerdock codes
Golay codewords are useful for transmission schemes such as OFDM, and [MacWilliams/Sloane] demonstrated that these codewords are bent functions contained in second order Reed-Muller codes. This paper investigates the intersection between these codes and Kerdock-like codes.
متن کامل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...
متن کاملChannel Estimation with Systematic Polar Codes
Study of polar codes in fading channels is of great importance when applying polar codes in wireless communications. Channel estimation is a fundamental step for communication to be possible in fading channels. For both systematic and non-systematic polar codes, construction of them is based on an information set and the known frozen bits. Efficient implementation of systematic and non-systemat...
متن کاملConvolutional Polar Codes
Arikan’s Polar codes [1] attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by β < 1 2 . Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Information Transmission
سال: 2018
ISSN: 0032-9460,1608-3253
DOI: 10.1134/s0032946018040014