This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more codewords. Algorithms for encoding and decoding ...

Manuscript received January 2006. † The author is with Power Generation Laboratory, Korea Electric Power Research Institute, 103-16, Moonji-dong, Yuseong-gu, Daejeon, Korea †† The author is with the Department of Electrical Engineering, Korea Advanced Institute of Science and Technology, 373-1, Guseong-dong, Yuseong-gu, Daejeon, Korea Parallel Decoding of Context-based Adaptive Binary Arithmeti...

We adapt the “hook” trick for speeding up bilexical parsing to the decoding problem for machine translation models that are based on combining a synchronous context free grammar as the translation model with an n-gram language model. This dynamic programming technique yields lower complexity algorithms than have previously been described for an important class of translation models.

A prominent feature of motor cortex field potentials during movement is a distinctive low-frequency local field potential (lf-LFP) (<4 Hz), referred to as the movement event-related potential (mEP). The lf-LFP appears to be a global signal related to regional synaptic input, but its relationship to nearby output signaled by single unit spiking activity (SUA) or to movement remains to be establi...

This work deals with coding systems based on sparse graphs. The key issue we address is the relationship between iterative (in particular belief propagation) and maximum a posteriori decoding. We show that between the two there is a fundamental connection, which is reminiscent of the Maxwell construction in thermodynamics. The main objects we consider are EXIT-like functions. EXIT functions wer...

In the problem of one-bit compressed sensing, the goal is to find an ǫ-close estimation of a ksparse vector x ∈ R given the signs of the entries of y = Φx, where Φ is called the measurement matrix. Similarly, in the problem of compressed sensing from phaseless measurements, the goal is to estimate a k-sparse vector x ∈ C given only the magnitudes of the measurements y = |Φx|. For the one-bit co...

We construct an explicit family of linear rank-metric codes over any field Fh that enables efficient list decoding up to a fraction ρ of errors in the rank metric with a rate of 1−ρ−ε, for any desired ρ ∈ (0, 1) and ε > 0. Previously, a Monte Carlo construction of such codes was known, but this is in fact the first explicit construction of positive rate rank-metric codes for list decoding beyon...

SIRR-based parametric decoding in the context of concert hall auralization Juan Pablo ESPITIA HURTADO; Jean-Dominique POLACK; Olivier WARUSFEL 1 UPMC Univ Paris 06, UMR 7190, Institut Jean Le Rond d’Alembert, F-75005 Paris, France 2 CNRS, UMR 7190, Institut Jean Le Rond d’Alembert, F-75005 Paris, France 3 UMR 9912, Sciences et Techniques de la Musique et du Son, IRCAM-CNRS-UPMC, F-75004 Paris, ...

We construct an explicit family of linear rank-metric codes over any field Fh that enables efficient list decoding up to a fraction ρ of errors in the rank metric with a rate of 1− ρ− ε, for any desired ρ ∈ (0, 1) and ε > 0. Previously, a Monte Carlo construction of such codes was known, but this is in fact the first explicit construction of positive rate rank-metric codes for list decoding bey...

Humans are biased toward social interaction. Behaviorally, this bias is evident in the rapid effects that self-relevant communicative signals have on attention and perceptual systems. The processing of communicative cues recruits a wide network of brain regions, including mentalizing systems. Relatively less work, however, has examined the timing of the processing of self-relevant communicative...