Sciweavers

1033 search results - page 4 / 207
» Stop the numbers game
Sort
View
TIT
2008
103views more  TIT 2008»
13 years 8 months ago
Improved Probabilistic Bounds on Stopping Redundancy
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
Junsheng Han, Paul H. Siegel, Alexander Vardy
INFOCOM
2009
IEEE
14 years 3 months ago
Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...
EJC
2008
13 years 8 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
JCT
2008
101views more  JCT 2008»
13 years 8 months ago
Refined activation strategy for the marking game
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
Xuding Zhu
TIT
2008
102views more  TIT 2008»
13 years 8 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
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...
Tadashi Wadayama