Learn More
This paper proposes a network coding approach to cooperative diversity featuring the algebraic superposition of channel codes over a finite field. The scenario under consideration is one in which two ldquopartnersrdquo - node A and node B - cooperate in transmitting information to a single destination; each partner transmits both locally generated(More)
We propose a joint source-channel decoding approach for multidimensional correlated source signals. A Markov random field (MRF) source model is used which exemplarily considers the residual spatial correlations in an image signal after source encoding. Furthermore, the MRF parameters are selected via an analysis based on extrinsic information transfer(More)
In this paper we address design and properties of an oversampled non-uniform DFT filter bank derived by an allpass frequency transform from its uniform version. The novel synthesis bank utilizes only stable FIR filters, which can be designed via closed-form expressions. The overall analysis-synthesis system leads to a near-perfect-reconstruction solution,(More)
This paper proposes a novel distributed encoding procedure to realize codes that resemble LT codes (rateless codes for erasure correction) in both structure and performance. For the case of two sources communicating with a single sink via a common relay, this technique separately encodes k/2 symbols of information onto slightly more than k code symbols at(More)
A secret sharing scheme is a method to store information securely and reliably. Particularly, in a threshold secret sharing scheme, a secret is encoded into n shares, such that any set of at least t<sub>1</sub> shares suffice to decode the secret, and any set of at most t<sub>2</sub> &lt;; t<sub>1</sub> shares reveal no information about the secret.(More)
—We present a novel symbol-based soft-input a poste-riori probability (APP) decoder for packetized variable-length encoded source indexes transmitted over wireless channels where the residual redundancy after source encoding is exploited for error protection. In combination with a mean-square or maximum APP estimation of the reconstructed source data, the(More)
——We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper’'s channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding scheme also achieves the capacity of the physically degraded receiver-orthogonal relay channel. We show simulation(More)
— We address outer variable-length encoding of a first-order Markov source in a serially concatenated coding scheme with an inner recursive convolutional code. Decoding is carried out iteratively between the constituent decoders for variable-length and convolutional code. While variable-length codes are commonly known to be sensitive to transmission errors,(More)
Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers were usually happy with performance that came within a few decibels of the Shannon Limit, primarily due to(More)
—We propose relaying strategies for uncoded two-way relay channels, where two terminals transmit simultaneously to each other with the help of a relay. In particular, we consider a memoryless system, where the signal transmitted by the relay is obtained by applying an instantaneous relay function to the previously received signal. For binary antipodal(More)