The growing number of Internet Thing (IoT) and Ultra-Reliable Low Latency Communications (URLCC) use cases in next generation communication networks calls for the development efficient Forward Error Correction (FEC) mechanisms. These usually imply using short to mid-sized information blocks requires low-complexity and/or fast decoding procedures. This paper investigates joint learning mid block...

A novel construction of Mixed Parity Code for secret message communication is presented in this paper. Mixed Parity Code is a tool for secured data transmission with bit error control mechanism. The construction procedure of this code is provided based on the choices of existing error control codes and existing message character sets. Crypto-code words are prepared by the combinations of messag...

The goal of this paper is to reduce the decoding complexity of space-time block turbo-coded system with low performance degradation. Two block turbo-coded systems with antenna diversity are considered. These include the simple serial concatenation of error control code with space-time block code, and the recently proposed transmit antenna diversity scheme using forward error correction techniqu...

If a linear block code C of length n has a Tanner graph without cycles, then maximum-likelihood soft-decision decoding of C can be achieved in time O(n). However, we show that cycle-free Tanner graphs cannot support good codes. Specifically, let C be an (n, k, d) linear code of rate R = k/n that can be represented by a Tanner graph without cycles. We prove that if R ≥ 0.5 then d ≤ 2, while if R...

In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense that no two strings in the code can give rise to the same string after r repetitions. We propose explicit number theoretic constructions of such subsets. In the case of r = 1 repetition, the proposed construction is asym...

Tables are presented of good ternary and quaternary codes and they are used in the construction of dense sphere packings. Results include 1) tables of the best ternary and quaternary constacyclic codes (including cyclic codes) up to block length 50, 2 ) a class of optimal [ n , 21 codes over GF(q), 3) the ( U + U + w I2u + U I U ) construction, a new ternary code construction technique that can...

This paper investigates polar codes for q-ary input channels using other kernels than [ 1 0 1 1 ] to construct the generator matrix. The kernel is optimized by maximizing the spread of the polar martingale and it is shown that in certain cases, the resulting construction has a significantly improved error probability (even at small block length like n = 1024).

Maximum-distance separable (MDS) convolutional codes form an optimal family of convolutional codes, the study of which is of great importance. There are very few general algebraic constructions of MDS convolutional codes. In this paper, we construct a large family of unit-memory MDS convolutional codes over Fq with flexible parameters. Compared with previous works, the field size q required to ...