Research on linear solvability of network coding based cooperative recovery scheme
The linear solvability of network coding based cooperative recovery/repair (CR) scheme was studied.Specifically, the solvability analysis model for network coding based CR scheme was established, the upper and lower bounds of the probability for any receiver to decode all original information under...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2021-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021050/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The linear solvability of network coding based cooperative recovery/repair (CR) scheme was studied.Specifically, the solvability analysis model for network coding based CR scheme was established, the upper and lower bounds of the probability for any receiver to decode all original information under arbitrary order of Galois coding field were proposed and proved, and an on-line solvability judgement algorithm was designed by improvement of Gauss-Jordan algorithm.Numerical results validate the compactness of the proposed upper and lower bounds as well as the short-time decoding waiting delay of the improved Gauss-Jordan algorithm.Node deployment experiments show that the decoding complexity of the improved Gauss Jordan algorithm is reduced by 35% compared with the traditional Gauss algorithm. |
|---|---|
| ISSN: | 1000-436X |