80 search results - page 10 / 16 » Bounds on the decoding complexity of punctured codes on grap... |
102
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
108
Voted
SAC
2000
ACM
15 years 4 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
TIT
2008
14 years 11 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
108
click to vote
STOC
2009
ACM
16 years 6 days ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...