Name
Abstract | ||
|---|---|---|
A code is said to possess the combination property if $k$ source packets are mapped into $n \\geq k$ packets and any $k$ out of these $n$ packets are able to recover the information of the original $k$ packets. While the class of maximum-distance-separable codes are well known to have this property, its decoding complexity is generally high. For this reason, a new class of codes which can be decoded by the zigzag-decoding algorithm is considered. It has a lower decoding complexity at the expense of extra storage overhead in each parity packet. In this work, a new construction of a zigzag decodable code is proposed. The novelty of this new construction lies in the careful selection of the amount of bit-shift of each source packet in obtaining each parity packet. Besides, an efficient on-the-air repair scheme based on physical-layer network coding is designed. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TMC.2016.2591537 | IEEE Trans. Mob. Comput. |
Keywords | Field | DocType |
Decoding,Decision support systems,Complexity theory,Network coding,Encoding,Maintenance engineering,Wireless sensor networks | Linear network coding,Wireless,Computer science,Network packet,Distributed data store,Decoding methods,Zigzag,Code (cryptography),Encoding (memory),Distributed computing | Journal |
Volume | Issue | ISSN |
16 | 5 | 1536-1233 |
Citations | PageRank | References |
1 | 0.35 | 39 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingjun Dai | 1 | 119 | 16.32 |
| Chi Wan Sung | 2 | 779 | 91.41 |
| Hui Wang | 3 | 23 | 3.97 |
| Xueqing Gong | 4 | 3 | 0.73 |
| Zexin Lu | 5 | 213 | 15.18 |