We propose a new state-constrained signal code, namely repeat-accumulate signal code (RASC). The original state-constrained signal code directly encodes modulation signals by signal processing filters, the filter coefficients of which are constrained over Eisenstein rings. Although the performance of signal codes is defined by signal filters, optimum filters were found by brute-force search in ...

This paper presents an algorithm, called JustIn-Case Schedulkg, for building robust schedules that tend not to break. The algorithm implements the common sense idea of being prepared for likely errors, just in case they should occur. The Just-In-Case algorithm analyzes a given nominal schedule, determines the most likely break, and reinvokes a scheduler to generate a contingent schedule to cove...

In this paper we will introduce an ensemble of codes called irregular repeat-accumulate (IRA) codes. IRA codes are a generalization of the repeat-accumluate codes introduced in [1], and as such have a natural linear-time encoding algorithm. We shall prove that on the binary erasure channel, IRA codes can be decoded reliably in linear time, using iterative sum-product decoding, at rates arbitrar...

The present communication brings to the fore the work undertaken at IRCAM within CAL within the framework of the language planning of Amazigh, particularly on the side of terminology. The focus will be on the concept of “variation” that affects different levels in the course of standardizing a language: orthography, spelling, grammar and lexis. Thus, after a brief survey of the main features of...

A pseudorandom correlation generator (PCG) is a recent tool for securely generating useful sources of correlated randomness, such as random oblivious transfers (OT) and vector linear evaluations (VOLE), with low communication cost. We introduce simple new design PCGs based on so-called expand-accumulate codes, which first apply sparse expander graph to replicate each message entry, then accumul...