Search

Polar code is a class of linear error-correcting codes that may demonstrably achieve the capacity of discrete memoryless channels. In the last decade, they have piqued the interest of industry and academia, such as the 5G (5th generation) wireless communication system standardization process. Although polar codes are proven to achieve the Shannon limit, their performance degrades at finite-code lengths, particularly in low signal-to-noise ratio (SNR) environments. So in a regime with finite _length, the performance of polar code may be improved by several techniques, such as Turbo Polar Codes (TPCs). Various Soft_in_Soft_out (SISO) decoder techniques, such as soft_cancellation (SCAN), belief_propagation (BP), and soft_successive_cancellation_list (SSCL) can be utilized in TPC. On the other hand, using a simple scaling factor scheme to minimize the overestimation of extrinsic information and its correlation with intrinsic information can further improve performance. Different termination techniques are proposed in the literature to reduce the required number of iterations, especially at high SNR. Error detection and correction systems are utilised to reduce energy consumption. This paper reviews some of the recent decoding techniques used in TPC. [ABSTRACT FROM AUTHOR]

The main goal of this paper is study the properties of the subsets (points, lines, planes) of PG (3, 2) and then study the effect of orbit 031 and 051 on the projective 3 – space. We found the arcs and caps of the five size with different degrees, so the three size represents a line and finds index i points for each orbit. The research also aims to find that the parameters of codes n, k, d, q was calculated. Also, the stabilizer group 5-arcs of PG (3.q) are constructed. [ABSTRACT FROM AUTHOR]

Currently, in order to improve the reliability and data protection in various automation systems, error-correcting codes are used. In the process of error-correcting coding, redundant bits are introduced into the information sequence, which reduces the real information transfer rate. You can adjust the degree of code redundancy using perforation (puncturing code bits). The paper investigates the implementation effectiveness of perforation in block codes when using the method of selecting the value of punctured bit. [ABSTRACT FROM AUTHOR]

Linear code is a very basic code and very useful in coding theory. Generally, linear code is a code over finite field in Hamming metric. Among the most interesting families of codes, the family of self-dual code is a very important one, because it is the best known error-correcting code. The concept of Hamming metric is develop into Rosenbloom-Tsfasman metric (RT-metric). The inner product in RT-metric is different from Euclid inner product that is used to define duality in Hamming metric. Most of the codes which are self-dual in Hamming metric are not so in RT-metric. And, generator matrix is very important to construct a code because it contains basis of the code. Therefore in this paper, we give some theorems and methods to construct self-dual codes in RT-metric by considering properties of the inner product and generator matrix. Also, we illustrate some examples for every kind of the construction. [ABSTRACT FROM AUTHOR]