Results 1  10
of
687
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
limit performance of "Turbo Codes" codes whose decoding algorithm is equivalent to loopy belief propagation in a chainstructured Bayesian network. In this paper we ask: is there something spe cial about the errorcorrecting code context, or does loopy propagation work as an ap proximate inference scheme
Decoding of Cyclic Codes over . . .
, 1998
"... We give a simple decoding algorithm to decode linear cyclic codes of odd length over the ring R = F2 + uF2 = f0; 1; u; u = u + 1g, where u 2 = 0. A spectral representation of the cyclic codes over R is given and a BCH like bound is given for the Lee distance of the codes. The ring R shares many ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We give a simple decoding algorithm to decode linear cyclic codes of odd length over the ring R = F2 + uF2 = f0; 1; u; u = u + 1g, where u 2 = 0. A spectral representation of the cyclic codes over R is given and a BCH like bound is given for the Lee distance of the codes. The ring R shares many
Decoding cyclic codes: the Cooper philosophy
"... In 1990, Cooper [6, 7] suggested to use Gröbner basis computation in order to deduce error locator polynomials of cyclic codes. Following his idea, Chen et al. [3, 4, 5] suggested a general algorithm to pursue Cooper’s approach. The aim of the talk is to follow, on an illuminating example, the arg ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
, the arguments which, through a series of papers [8, 2, 9], led to the following result: Theorem 1. For each [n, k, d] binary cyclic code C with n odd, denoting F the splitting field of xn − 1 over Z2, a proper Gröbner basis computation allows to produce a polynomial L ∈ Z2[X, z], where X = (x1,..., xn−k) which
2011 8th International Symposium on Wireless Communication Systems, Aachen New Achievable Rates for the Gaussian Broadcast Channel with Feedback
"... Abstract—A coding scheme for the tworeceivers Gaussian broadcast channel (BC) with feedback is proposed. For some asymmetric settings it achieves new rate pairs. Moreover, it achieves prelog 2 when the noises at the two receivers are fully positively correlated and of unequal variances, thus allowi ..."
Abstract
 Add to MetaCart
Abstract—A coding scheme for the tworeceivers Gaussian broadcast channel (BC) with feedback is proposed. For some asymmetric settings it achieves new rate pairs. Moreover, it achieves prelog 2 when the noises at the two receivers are fully positively correlated and of unequal variances, thus
On (1 − u m )Cyclic Codes over
, 2009
"... Abstract A new Gray map between codes over F 2 + uF 2 + u 2 F 2 + u 3 F 2 + .... + u m F 2 and codes over F 2 is defined. It is proved that the Gray image of a linear (1 − u m )cyclic code over of length n is a binary distance invariant quasicylic code of index 2 m−1 and length 2 m n. It is also ..."
Abstract
 Add to MetaCart
proved that if n is odd, then every code of length 2 m n over F 2 which is the Gray image of a linear cyclic code of length n over F 2 + uF 2 + u 2 F 2 + u 3 F 2 + .... + u m F 2 is equivalent to a quasicyclic code of index 2 m−1 . Mathematics Subject Classification: 94B15, 94B60
1SpaceTime PhysicalLayer Network Coding
"... Abstract—A spacetime physicallayer network coding (STPNC) method is presented for information exchange among multiple users over fullyconnected multiway relay networks. The method involves two key steps: i) sideinformation learning and ii) spacetime relay transmission. In the first phase of s ..."
Abstract
 Add to MetaCart
linear combinations of received signals in the previous phase using spacetime precoding so that all users efficiently exploit their sideinformation in the form of: 1) what they sent and 2) what they overheard in decoding. This coding concept is illustrated through two simple network examples
TO CODE OR NOT TO CODE
, 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract
 Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:
1On NonBinary Constellations for ChannelCoded PhysicalLayer Network Coding
"... Abstract—We investigate channelcoded physicallayer network coding in a twoway relaying scenario, where the end nodes A and B choose their symbols, SA and SB, from a small nonbinary field, F, and adopt a nonbinary PSK modulation. The relay then directly decodes the networkcoded combination aSA ..."
Abstract
 Add to MetaCart
SA + bSB over F from the noisy received superimposed channelencoded packets. The advantage of working over nonbinary fields is that it offers the opportunity to decode according to multiple decoding coefficients (a, b). As only one of the networkcoded combinations needs to be successfully decoded, a
1 Interference Channel with an OutofBand Relay
"... Abstract—A Gaussian interference channel (IC) with a relay is considered. The relay is assumed to operate over an orthogonal band with respect to the underlying IC, and the overall system is referred to as IC with an outofband relay (ICOBR). The system can be seen as operating over two parallel i ..."
Abstract
 Add to MetaCart
Abstract—A Gaussian interference channel (IC) with a relay is considered. The relay is assumed to operate over an orthogonal band with respect to the underlying IC, and the overall system is referred to as IC with an outofband relay (ICOBR). The system can be seen as operating over two parallel
Results 1  10
of
687