Bandwidth Overhead-Free Data Reconstruction Scheme for Distributed Storage Code With Low Decoding Complexity
The (n, k) combination property (CP) is defined as follows: k source packets are mapped into n ≥ k packets and any k out of these n packets are able to recover the information of the original k packets. This (n, k) CP is extensively needed by cloud storage service providers. Reed-Solomon...
Main Authors: | Mingjun Dai, Xia Wang, Hui Wang, Xiaohui Lin, Bin Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7913577/ |
Similar Items
-
Design of Coded ALOHA With ZigZag Decoder
by: Masaru Oinaga, et al.
Published: (2019-01-01) -
Application of ZigZag Decoding in Frameless ALOHA
by: Shun Ogata, et al.
Published: (2019-01-01) -
The decoding schemes of LDPC-codes. The efficiency ratings, advantages and further developments of LDPC-codes
by: A. G. Soltanov
Published: (2010-06-01) -
Hardware Design of Concatenated Zigzag Hadamard Encoder/Decoder System With High Throughput
by: Sheng Jiang, et al.
Published: (2020-01-01) -
Simplified polar code decoding algorithm
by: Wang Dan, et al.
Published: (2018-06-01)