In this paper, we present the block Markov superposition transmission of BCH (BMST-BCH) codes, which can be constructed to obtain a very low error floor. To reduce the implementation complexity, we design a low complexity iterative sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between processing units. The error floor can be predicted by the proposed genie-aided lower bounds, while the waterfall performance can be analyzed by the density evolution method. To evaluate the error floor of the constructed BMST-BCH codes at a very low bit error rate (BER) region, we propose a fast simulation approach. Numerical results show that, at a target BER of 10-15, the proposed BMST-BCH code with hard-decision can achieve a net coding gain (NCG) of 10.55 dB with 25% overhead, while a soft-decision design can yield an NCG of 10.74 dB. The construction of BMST-BCH codes is flexible to trade off latency against performance at all overheads of interest and may find applications in optical transport networks as an attractive candidate.

This paper is concerned with block Markov super-position transmission of BCH (BMST-BCH) codes. Compared with other BMST codes, BMST-BCH codes can achieve a lower error floor with an encoding memory of two, which is critical to reduce both delay and implementation complexity. To further reduce the implementation complexity, we propose a hard-decision sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between nodes. A fast simulation approach is proposed, with the help of the genie-aided lower bound and the density evolution analysis, to evaluate the performance of BMST-BCH codes at the BER of 10-15. BMST-BCH codes are constructed with overheads ranging from 15% to 25%, exhibiting performances comparable to staircase codes with similar latencies. The proposed construction is more flexible to trade off latency against performance, and may find applications in optical transport networks as an attractive candidate.

One primary challenge in the high-speed train (HST) communication is that the wireless signal suffers from severe attenuation while it penetrates the sealed carriage of the train. In this letter, we show that such a nuisance can provide an opportunity of improving the uplink capacity when a full-duplex (FD) mobile relay (MR) is furnished on the train. To this end, by introducing the self-interference cancellation (SIC) level, we present an uplink channel model for the HST communication with FD MR. Then the uplink capacity is analyzed under either user equipment power constraint or total power constraint. By comparing with time division scheme, we can derive the required SIC level for the FD scheme to bring capacity improvement, which is confirmed by numerical results. Furthermore, theoretical analysis shows that, for a given SIC level, the uplink channel with severer carriage attenuation has higher capacity, which is also validated by numerical results.