Compared to traditional statistical machine translation (SMT), neural machine translation (NMT) often sacrifices adequacy for the sake of fluency. We propose a method to combine the advantages of traditional SMT and NMT by exploiting an existing phrase-based SMT model to compute the phrase-based decoding cost for an NMT output and then using this cost to rerank the n-best NMT outputs. The main ...

An interesting class of l inear error-correcting codes has been found by Goppa [3], [4]. This paper presents algebraic decoding algorithms for the Goppa codes. These algorithms are only a little more complex than Berlekamp’s well-known algorithm for BCH codes and, in fact, make essential use of his procedure. Hence the cost of decoding a Goppa code is similar to the cost of decoding a BCH code ...

An efficient scheme for JPEG2000 SNR progressive decoding is proposed, which is capable of handling JPEG2000 compressed image data with SNR progressiveness. In order to avoid entropy decoding of the same compressed data more than once when decoding SNR progressive images, two techniques are introduced in our decoding scheme; reuse of intermediate decoding result and differential inverse discret...

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...

A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.

SUMMARY We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MD...

Decoding with feedback or iterative decoding is an eecient, low-complexity means for \informa-tion handover" in any parallel or serial concate-nated coding scheme and in related applications. Invented twenty years ago, it has recently been payed considerable attention in the context of \Turbo Codes". Iterative decoding has been jus-tiied intuitively, but many question remain and perhaps will re...

A new adaptive trellis decoding technique for block codes is proposed. The technique is based on a recently introduced encoding technique which allows the design of almost all known linear codes together with their minimal trellises. The proposed adaptive trellis decoding technique allows t h e implementation of a single sof t maximum likelihood trellis decoder for decoding of different codes. ...

Linear programming (LP) decoding of low-density parity-check codes was introduced by Feldman et al. in [1]. In his formulation it is assumed that communication takes place over a memoryless channel and that the source is uniform. Here, we extend the LP decoding paradigm by studying its application to scenarios with source nonuniformity and to decoding over channels with memory. We develop two d...

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...