LDPC coded transmissions over the Gaussian broadcast channel with confidential messages

We design and assess some practical low-density parity-check (LDPC) coded transmission schemes for the Gaussian broadcast channel with confidential messages (BCC). This channel model is different from the classical wiretap channel model as the unauthorized receiver (Eve) must be able to decode some part of the information. Hence, the reliability and security targets are different from those of the wiretap channel. In order to design and assess practical coding schemes, we use the error rate as a metric of the performance achieved by the authorized receiver (Bob) and the unauthorized receiver (Eve). We study the system feasibility, and show that two different levels of protection against noise are required on the public and the secret messages. This can be achieved in two ways: i) by using LDPC codes with unequal error protection (UEP) of the transmitted information bits or ii) by using two classical non-UEP LDPC codes with different rates. We compare these two approaches and show that, for the considered examples, the solution exploiting UEP LDPC codes is more efficient than that using non-UEP LDPC codes.Comment: 5 pages, 5 figures, to be presented at IEEE ICT 201

Error Resilience in Distributed Storage via Rank-Metric Codes

This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of erroneous data from a single corrupted node to the rest of the system during a node repair process. This paper presents a concatenated coding scheme which is based on two types of codes: maximum rank distance (MRD) code as an outer code and optimal repair maximal distance separable (MDS) array code as an inner code. Given this, two different types of adversarial errors are considered: the first type considers an adversary that can replace the content of an affected node only once; while the second attack-type considers an adversary that can pollute data an unbounded number of times. This paper proves that the proposed coding scheme attains a suitable upper bound on resilience capacity for the first type of error. Further, the paper presents mechanisms that combine this code with subspace signatures to achieve error resilience for the second type of errors. Finally, the paper concludes by presenting a construction based on MRD codes for optimal locally repairable scalar codes that can tolerate adversarial errors

A Purely Symbol-Based Precoded and LDPC-Coded Iterative-Detection Assisted Sphere-Packing Modulated Space-Time Coding Scheme

In this contribution, we propose a purely symbol-based LDPC-coded scheme based on a Space-Time Block Coding (STBC) signal construction method that combines orthogonal design with sphere packing, referred to here as (STBCSP). We demonstrate that useful performance improvements may be attained when sphere packing aided modulation is concatenated with non-binary LDPC especially, when performing purely symbol-based turbo detection by exchanging extrinsic information between the non-binary LDPC decoder and a rate-1 non-binary inner precoder. We also investigate the convergence behaviour of this symbol-based concatenated scheme with the aid of novel non-binary Extrinsic Information Transfer (EXIT) Charts. The proposed symbol-based turbo-detected STBC-SP scheme exhibits a 'turbo-cliff' at Eb/N0 = 5.0 dB and achieves an Eb/N0 gain of 19.2dB at a BER of 10-5 over Alamouti’s scheme

A Turbo Detection and Sphere-Packing-Modulation-Aided Space-Time Coding Scheme

Arecently proposed space-time block-coding (STBC) signal-construction method that combines orthogonal design with sphere packing (SP), referred to here as STBC-SP, has shown useful performance improvements over Alamouti’s conventional orthogonal design. In this contribution, we demonstrate that the performance of STBC-SP systems can be further improved by concatenating SP-aided modulation with channel coding and performing demapping as well as channel decoding iteratively. We also investigate the convergence behavior of this concatenated scheme with the aid of extrinsic-information-transfer charts. The proposed turbo-detected STBC-SP scheme exhibits a “turbo-cliff” at Eb/N0 = 2.5 dB and provides Eb/N0 gains of approximately 20.2 and 2.0 dB at a bit error rate of 10?5 over an equivalent throughput uncoded STBC-SP scheme and a turbo-detected quadrature phase shift keying (QPSK) modulated STBC scheme, respectively, when communicating over a correlated Rayleigh fading channel. Index Terms—EXIT charts, iterative demapping, multidimensional mapping, space-time coding, sphere packing, turbo detection

大規模多元接続ネットワークのためのグラフ構造に基づくランダムアクセス方式

電気通信大学201

On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes

This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured. The condition is formulated in terms of degree-1 and degree-2 variable nodes and of low-weight codewords of the underlying code, and it generalizies results known for turbo codes [8] and LDPC codes. Then, we present a new ensemble of low-rate codes, which itself is a subclass of TLDPC codes [4], [5], and which is designed under this necessary condition. The asymptotic analysis of the ensemble shows that its iterative threshold is situated close to the Shannon limit. In addition to the linear minimum distance property, it has a simple structure and enjoys a low decoding complexity and a fast convergence.Comment: submitted to IEEE Trans. on Communication