Results 241 to 250 of about 700,792 (284)
Some of the next articles are maybe not open access.
Decoding Erasures for Nonsystematic RS Codes
2019 IEEE Region 10 Symposium (TENSYMP), 2019In the past, RS codes were initially encoded in nonsystematic forms to account for general RS codes that transform all components in a codeword. To avoid information leakage, RS code can also be encoded in nonsystematic forms like the general RS code-based cryptography.
Tao Wu, Ruomei Wang
openaire +1 more source
A Low-Complexity RS Decoder for Triple-Error-Correcting RS Codes
2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2019Reed-Solomon (RS) codes have been widely used in digital communication and storage systems. The commonly used decoding algorithms include Berlekamp-Massey (BM) algorithm and its variants such as the inversionless BM (iBM) and the Reformulated inversionless BM (RiBM).
Zengchao Yan, Jun Lin, Zhongfeng Wang
openaire +1 more source
Decoder Design for RS-Based LDPC Codes
IEEE Transactions on Circuits and Systems II: Express Briefs, 2009This brief studies very large-scale integration (VLSI) decoder architectures for RS-based low-density parity-check (LDPC) codes, which are a special class of LDPC codes based on Reed-Solomon codes. The considered code ensemble is well known for its excellent error-correcting performance and has been selected as the forward error correction coding ...
null Jin Sha +4 more
openaire +2 more sources
Scale-RS: An Efficient Scaling Scheme for RS-Coded Storage Clusters
IEEE Transactions on Parallel and Distributed Systems, 2015It is indispensable to scale erasure-coded storage clusters to meet requirements of increased storage capacity and I/O performance. In this study, we propose an efficient scaling scheme for Reed-Solomon-coded storage clusters called Scale-RS, which has three salient features.
Jianzhong Huang +4 more
openaire +1 more source
Iterative coding and decoding algorithm of RS digital fountain code
2008 11th IEEE Singapore International Conference on Communication Systems, 2008Combining forward error correcting and automatic repeat request is a commonly used method in digital communication system. But in broadcast communication system, this method will compromise the communication efficiency and cause longer transmission delay due to the need of retransmitting data. This problem, however, can be effectively solved by the use
null Weijia Lei +3 more
openaire +1 more source
An Anti-Collusion Fingerprinting based on CFF Code and RS Code
2020 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2020Data security is becoming more and more important in data exchange. Once the data is leaked, it will pose a great threat to the privacy and property security of users. Copyright authentication and data provenance have become an important requirement of the information security defense mechanism.
Yuxin Sun, Yingzhou Zhang, Linlin Zhu
openaire +1 more source
A decoding algorithm for DEC RS codes
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030), 2003A step-by-step decoding algorithm is proposed for double-error-correcting (DEC) Reed-Solomon (RS) codes of length n=2/sup m/-1. Since the decoding algorithm can directly find the error value at the highest-order position in a received vector without determining the error location polynomial, the decoding procedure is very simple and regular, and ...
null Erl-Huei Lu +2 more
openaire +1 more source
2019
This chapter begins presenting the original approach to Reed–Solomon (RS) codes exhibiting the generator matrix of the code. This is followed by an equivalent method that selects codewords “screening” words by the parity-check matrix. The familiar ideas of addition and multiplication of complex numbers are utilized to construct Galois fields using ...
openaire +1 more source
This chapter begins presenting the original approach to Reed–Solomon (RS) codes exhibiting the generator matrix of the code. This is followed by an equivalent method that selects codewords “screening” words by the parity-check matrix. The familiar ideas of addition and multiplication of complex numbers are utilized to construct Galois fields using ...
openaire +1 more source
2019
Abstract This chapter addresses the myth of ‘decentralized governance’ of public blockchains, arguing that certain people who create, operate, or reshape them function much like fiduciaries of those who rely on these data structures. It compares the role of leading software developers and Frankel’s conception of a ‘fiduciary’ and finds ...
openaire +1 more source
Abstract This chapter addresses the myth of ‘decentralized governance’ of public blockchains, arguing that certain people who create, operate, or reshape them function much like fiduciaries of those who rely on these data structures. It compares the role of leading software developers and Frankel’s conception of a ‘fiduciary’ and finds ...
openaire +1 more source
Serially Concatenated RS Codes with ST Turbo Codes Over Ring
2009In this paper, we investigate serially concatenated Reed-Solomon codes (RS) with the space-time turbo codes over ring ZM. The encoded QPSK signals are transmitted through the quasi-static and fast-fading multiple-input-multiple-output (MIMO) channel. In the receiver, we use the iterative soft input soft output (SOVA) algorithm.
P. Remlein, R. Orzechowski
openaire +1 more source