A code C ⊆ Fn 2 is a (c, ǫ, δ)-expander code if it has a Tanner graph, where every variable node has degree c, and every subset of variable nodes L0 such that |L0| ≤ δn has at least ǫc|L0| neighbors. Feldman et al. (IEEE IT, 2007) proved that LP decoding corrects 3ǫ−2 2ǫ−1 · (δn − 1) errors of (c, ǫ, δ)expander code, where ǫ > 2 3 + 1 3c . In this paper, we provide a simpler proof of their resu...

Joint source and channel decoding (JSCD) has been proved to be an effective technique which can improve decoding performance by exploiting residual source redundancy. Most previous publications on this subject focus on a traditional coding scheme in which the source variable-length coding (VLC) is serially concatenated with a channel code. In this paper, a parallel concatenated coding scheme fo...

In this letter, we propose to add dynamic frozen bits underlying polar codes with a Reed-Muller information set the aim of maintaining same sub-decoding structure in Automorphism Ensemble (AE) and lowering Maximum Likelihood (ML) bound by reducing number minimum weight codewords. We provide freezing constraint matrix that remains identical after applying permutation linear transformation. This ...

Tandem coding and decoding has been demonstrated to yield arbitrarily low error rates provided a sufficiently large block length is used. When applied to practical systems that are inherently limited to a finite complexity and therefore to finite block lengths, such a strategy may be largely suboptimal. Indeed, a tandem decoding strategy ignores two types of information: the source memory and t...

Analog Joint Source-Channel Coding (JSCC) has been shown to approach the optimal distortion-cost tradeoff when transmitting over AWGN channels. In this work we consider analog JSCC over frequency-selective channels using Orthogonal Frequency Division Multiplexing (OFDM) modulation and multiple antennas at transmission and/or reception, i.e. using a MIMO-OFDM system. Due to its high complexity, ...

Dependency tree-to-tree translation models are powerful because they can naturally handle long range reorderings which is important for distant language pairs. The translation process is easy if it can be accomplished only by replacing non-terminals in translation rules with other rules. However it is sometimes necessary to adjoin translation rules. Flexible non-terminals have been proposed as ...

Analogue joint source-channel coding (JSCC) has been shown to approach the optimal distortion-cost trade-off when transmitting over additive white Gaussian noise channels. In this work, we consider analogue JSCC over frequencyselective channels using orthogonal frequency division multiplexing (OFDM) modulation and multiple antennas at transmission and/or reception, that is, using a multiple inp...

Recently, kernel eigenvoices were revisited using kernel representations of distributions for rapid nonlinear speaker adaptation. These representations reassure the validity of the adapted distribution functions and enable expectation-maximisation training. Though gains have been shown in terms of word error rate for rapid speaker adaptation, this approach leads to an increase in decoding cost ...

System combination is a common approach to improving results for both speech transcription and keyword spotting—especially in the context of low-resourced languages where building multiple complementary models requires less computational effort. Using state-of-the-art CNN and DNN acoustic models, we analyze the performance, cost, and trade-offs of four system combination approaches: feature com...