Name
Title | ||
|---|---|---|
Improving the probability of complete decoding of random code by trading-off computational complexity. |
Abstract | ||
|---|---|---|
Random code is a rateless erasure code that can reconstruct the original message of k symbols from any k + 10 encoded symbols with high probability of complete decoding (PCD), i.e. 99.9% successful decoding, irrespective of the message length, k. Nonetheless, random code is inefficient in reconstructing short messages. For example, a message of k = 10 symbols requires k + 10 = 20 encoded symbols, ... |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1049/iet-com.2015.0295 | IET Communications |
Keywords | Field | DocType |
computational complexity,decoding,matrix algebra,probability,random codes | Online codes,Repetition code,Code rate,Constant-weight code,Self-synchronizing code,Fountain code,Systematic code,Computer science,Algorithm,Erasure code | Journal |
Volume | Issue | ISSN |
9 | 18 | 1751-8628 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zan-Kai Chong | 1 | 5 | 2.16 |
| Bok-Min Goi | 2 | 498 | 62.02 |
| Hiroyuki Ohsaki | 3 | 259 | 63.46 |
| Cheng-Kuan Bryan Ng | 4 | 5 | 1.82 |
| Hong-Tat Ewe | 5 | 28 | 6.12 |