1579 search results - page 96 / 316 » On the Constructions of Constant-Weight Codes |
155
click to vote
FOCS
2007
IEEE
16 years 19 days ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
154
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
169
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
140
click to vote
WIESS
2000
15 years 7 months ago
2000
As IPC mechanisms become faster, stub-code efficiency becomes a performance issue for local client/server RPCs and inter-component communication. Inefficient and unnecessary compl...
159
click to vote
INFOCOM
2007
IEEE
16 years 18 days ago
2007
IEEE
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...