Security gap analysis of some LDPC coded transmission schemes over the flat and fast fading Gaussian wire-tap channels

n/

Quasi-Perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension

A construction of two-quasi-perfect Lee codes is given over the space ?np for p prime, p ? ±5 (mod 12), and n = 2[p/4]. It is known that there are infinitely many such primes. Golomb and Welch conjectured that perfect codes for the Lee metric do not exist for dimension n ? 3 and radius r ? 2. This conjecture was proved to be true for large radii as well as for low dimensions. The codes found are very close to be perfect, which exhibits the hardness of the conjecture. A series of computations show that related graphs are Ramanujan, which could provide further connections between coding and graph theories

Near-capacity fixed-rate and rateless channel code constructions

Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density parity-check code (LDPC) constructions are proposed; the first construction constitutes a family of quasi-cyclic protograph LDPC codes, which has a Vandermonde-like parity-check matrix (PCM). The second construction constitutes a specific class of protograph LDPC codes, which are termed as multilevel structured (MLS) LDPC codes. These codes possess a PCM construction that allows the coexistence of both pseudo-randomness as well as a structure requiring a reduced memory. More importantly, it is also demonstrated that these benefits accrue without any compromise in the attainable BER/BLER performance. We also present the novel concept of separating multiple users by means of user-specific channel codes, which is referred to as channel code division multiple access (CCDMA), and provide an example based on MLS LDPC codes. In particular, we circumvent the difficulty of having potentially high memory requirements, while ensuring that each user’s bits in the CCDMA system are equally protected. With regards to rateless channel coding, we propose a novel family of codes, which we refer to as reconfigurable rateless codes, that are capable of not only varying their code-rate but also to adaptively modify their encoding/decoding strategy according to the near-instantaneous channel conditions. We demonstrate that the proposed reconfigurable rateless codes are capable of shaping their own degree distribution according to the nearinstantaneous requirements imposed by the channel, but without any explicit channel knowledge at the transmitter. Additionally, a generalised transmit preprocessing aided closed-loop downlink multiple-input multiple-output (MIMO) system is presented, in which both the channel coding components as well as the linear transmit precoder exploit the knowledge of the channel state information (CSI). More explicitly, we embed a rateless code in a MIMO transmit preprocessing scheme, in order to attain near-capacity performance across a wide range of channel signal-to-ratios (SNRs), rather than only at a specific SNR. The performance of our scheme is further enhanced with the aid of a technique, referred to as pilot symbol assisted rateless (PSAR) coding, whereby a predetermined fraction of pilot bits is appropriately interspersed with the original information bits at the channel coding stage, instead of multiplexing pilots at the modulation stage, as in classic pilot symbol assisted modulation (PSAM). We subsequently demonstrate that the PSAR code-aided transmit preprocessing scheme succeeds in gleaning more information from the inserted pilots than the classic PSAM technique, because the pilot bits are not only useful for sounding the channel at the receiver but also beneficial for significantly reducing the computational complexity of the rateless channel decoder

Construction of signal sets from quotient rings of the quaternion orders associated with arithmetic fuchsian groups

This paper aims to construct signal sets from quotient rings of the quaternion over a real number field associated with the arithmetic Fuchsian group Γ 4g , where g is the genus of the associated surface. These Fuchsian groups consist of the edge-pairing isometries of the regular hyperbolic polygons (fundamental region) P 4g , which tessellate the hyperbolic plane D 2 . The corresponding tessellations are the self-dual tessellations {4g, 4g}. Knowing the generators of the quaternion orders which realize the edge-pairings of the polygons, the signal points of the signal sets derived from the quotient rings of the quaternion orders are determined. It is shown by examples the relevance of adequately selecting the ideal in the maximal order to construct the signal sets satisfying the property of geometrical uniformity. The labeling of such signals is realized by using the mapping by set partitioning concept to solve the corresponding Diophantine equations (extreme quadratic forms). Trellis coded modulation and multilevel codes whose signal sets are derived from quotient rings of quaternion orders are considered possible applications8196050196061CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP305656/2015-52013/25977-