Results 1  10
of
514
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
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 Shannon
On the Convex Geometry of Binary Linear Codes
"... A code polytope is defined to be the convex hull in R n of the points in {0, 1} n corresponding to the codewords of a binary linear code. This paper contains a collection of results concerning the structure of such code polytopes. A survey of known results on the dimension and the minimal polyhedr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
polyhedral representation of a code polytope is first presented. We show how these results can be extended to obtain the complete facial structure of the polytope determined by the [n, n−1] evenweight code. We then give a result classifying the types of 3faces a general code polytope can have, which shows
Sampling signals with finite rate of innovation
 IEEE Transactions on Signal Processing
, 2002
"... Abstract—Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise polynomials ..."
Abstract

Cited by 350 (67 self)
 Add to MetaCart
and reconstruction based on spline kernels. The key in all constructions is to identify the innovative part of a signal (e.g., time instants and weights of Diracs) using an annihilating or locator filter: a device well known in spectral analysis and errorcorrection coding. This leads to standard computational
ON THE PROPERTIES AND COMPLEXITY OF
, 2005
"... People rely on the ability to transmit information over channels of communication that are subject to noise and interference. This makes the ability to detect and recover from errors extremely important. Coding theory addresses this need for reliability. A fundamental question of coding theory is wh ..."
Abstract
 Add to MetaCart
] in the course of studying stream ciphers. In this work we develop techniques for finding the multicovering radius of specific codes. In particular, we study the even weight code, the 2error correcting BCH code, and linear codes with covering radius one. We also study questions involving the complexity
Imprimitive cometric association schemes: constructions and analysis
 J. Algebraic Combin
"... Dedicated to the memory of Dom de Caen, 1956–2002. Dualizing the “extended bipartite double ” construction for distanceregular graphs, we construct a new family of cometric (or Qpolynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis o ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
list gives all examples of cometric association schemes known to us (see [15] for details on spherical designs): • Qpolynomial distanceregular graphs (this includes all symmetric 2class schemes); • duals of metric translation schemes (e.g, the subscheme induced on evenweight code
Complete weight enumerators of generalized doublyeven selfdual codes
, 2004
"... For any q which is a power of 2 we describe a finite subgroup of GLqðCÞ under which the complete weight enumerators of generalized doublyeven selfdual codes over Fq are invariant. An explicit description of the invariant ring and some applications to extremality of such codes are obtained in the c ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
For any q which is a power of 2 we describe a finite subgroup of GLqðCÞ under which the complete weight enumerators of generalized doublyeven selfdual codes over Fq are invariant. An explicit description of the invariant ring and some applications to extremality of such codes are obtained
Relations between the Local Weight Distributions of a Linear Block Code, Its Extended Code, and Its Even Weight Subcode
, 2005
"... Relations between the local weight distributions of a binary linear code, its extended code, and its even weight subcode are presented. In particular, for a code of which the extended code is transitive invariant and contains only codewords with weight multiples of four, the local weight distribut ..."
Abstract
 Add to MetaCart
Relations between the local weight distributions of a binary linear code, its extended code, and its even weight subcode are presented. In particular, for a code of which the extended code is transitive invariant and contains only codewords with weight multiples of four, the local weight
Impact of Interferences on Connectivity in Ad Hoc Networks
 in Proc. IEEE INFOCOM
, 2003
"... We study the impact of interferences on the connectivity of largescale adhoc networks, using percolation theory. We assume that a bidirectional connection can be set up between two nodes if the signal to noise ratio at the receiver is larger than some threshold. The noise is the sum of the contri ..."
Abstract

Cited by 156 (13 self)
 Add to MetaCart
of the contribution of interferences from all other nodes, weighted by a coefficient gamma, and of a background noise. We find that there is a critical value of gamma above which the network is made of disconnected clusters of nodes. We also prove that if gamma is non zero but small enough, there exist node spatial
Random coding techniques for nonrandom codes
 IEEE Trans. on Inform. Theory
, 1999
"... Abstract—This work provides techniques to apply the channel coding theorem and the resulting error exponent, which was originally derived for totally random blockcode ensembles, to ensembles of codes with less restrictive randomness demands. As an example, the random coding technique can even be ap ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
Abstract—This work provides techniques to apply the channel coding theorem and the resulting error exponent, which was originally derived for totally random blockcode ensembles, to ensembles of codes with less restrictive randomness demands. As an example, the random coding technique can even
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:
Results 1  10
of
514