A linear error-block code is a natural generalization of the classical error-correcting code and has applications in experimental design, high-dimensional numerical integration and cryptography. This article formulates the concept of a linear error-block code and derives basic results for this kind of code by direct analogy to the classical case. Some problems for further research are raised. ©...

A graph G with vertex set V is said to be n-existentially closed if, for every S ⊂ V with |S| = n and every T ⊆ S, there exists a vertex x ∈ V − S such that x is adjacent to each vertex of T but is adjacent to no vertex of S − T . Given a combinatorial design D with block set B, its block-intersection graph GD is the graph having vertex set B such that two vertices b1 and b2 are adjacent if and...

This paper presents a method of set partitionning for the Golden code. This space-time block code has been introduced in [1]. We show how to construct the Gosset lattice E8 as well as the Leech lattice Λ24. The same set partitionning is finally used to construct a trellis-coded modulation that outperforms the Golden code.

In this paper I take the view, common among statisticians, that a design is an allocation of a set Γ of n treatments to a set Ω of plots: see [2]. (The word plot does not necessarily denote a piece of ground: it is used for any type of experimental unit.) Thus the design may be thought of as a function f from Ω onto Γ: plot ω receives treatment γ if f(ω) = γ. If Ω is partitioned into blocks the...

Article history: Received 30 September 2007 Received in revised form 4 June 2008 Available online 23 May 2009

— In wireless broadband systems the available time, frequency and spatial diversity can be exploited using complex space-time-frequency codes. However, in order to retain a flexible scheme with low complexity we prefer a concatenated system where a channel code picks up time and frequency diversity and a simple orthogonal design is used to obtain spatial diversity. The channel needs to be const...

Turbo-decoding of nonbinary codes Jens Berkmann and Frank Burkert Dept. of Communications Engineering, Technical University of Munich Arcisstr. 21, 80290 Munich, Germany Email [email protected] Abstract | It is shown how parallel concatenation of nonbinary codes can be put into the same framework of iterative decoding as in the binary case. The turbocode(turbo-decoding-) idea is...

We study the optimal parameters to minimize the cheating probability and communication complexity in protocols for two party computation secure against malicious adversaries. In cut-and-choose protocols for two party computation, we analyze the optimal parameters to keep the probability of undetected cheating minimum. We first study this for a constant number of circuits, and then generalize it...