10 search results - page 1 / 2 » The Main Conjecture for MDS Codes |
IMA
1995
Springer
13 years 9 months ago
1995
Springer
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
CANS
2006
Springer
13 years 9 months ago
2006
Springer
We address the multicast stream authentication problem when the communication channel is under the control of an opponent who can drop, reorder or inject data. In such a network m...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...