Sciweavers

44 search results - page 6 / 9
» List Decoding of Burst Errors
Sort
View
TSP
2010
13 years 2 months ago
Low-complexity decoding via reduced dimension maximum-likelihood search
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam...
CORR
2007
Springer
90views Education» more  CORR 2007»
13 years 7 months ago
Rateless coding with partial state information at the decoder
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
Anand D. Sarwate, Michael Gastpar
ACL
2007
13 years 9 months ago
Minimum Bayes Risk Decoding for BLEU
We present a Minimum Bayes Risk (MBR) decoder for statistical machine translation. The approach aims to minimize the expected loss of translation errors with regard to the BLEU sc...
Nicola Ehling, Richard Zens, Hermann Ney
EMNLP
2008
13 years 9 months ago
Lattice-based Minimum Error Rate Training for Statistical Machine Translation
Minimum Error Rate Training (MERT) is an effective means to estimate the feature function weights of a linear model such that an automated evaluation criterion for measuring syste...
Wolfgang Macherey, Franz Josef Och, Ignacio Thayer...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 8 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra