Results 211 to 220 of about 92,121 (257)
Some of the next articles are maybe not open access.
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 ...
Jin Sha 0001 +4 more
openaire +4 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 0001 +4 more
openaire +2 more sources
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 +2 more
openaire +1 more source
2020
Bislang haben wir uns nur die Linearitat zunutze gemacht und noch keine fortgeschritteneren Methoden der Algebra verwendet. Rechnen mit Matrizen ist fur praktische Zwecke aber zu komplex. Wesentlich einfacher ist das Rechnen mit Polynomen, die auch in fruheren Kapiteln bereits eine wichtige Rolle gespielt haben.
Gisbert Wüstholz, Clemens Fuchs
openaire +1 more source
Bislang haben wir uns nur die Linearitat zunutze gemacht und noch keine fortgeschritteneren Methoden der Algebra verwendet. Rechnen mit Matrizen ist fur praktische Zwecke aber zu komplex. Wesentlich einfacher ist das Rechnen mit Polynomen, die auch in fruheren Kapiteln bereits eine wichtige Rolle gespielt haben.
Gisbert Wüstholz, Clemens Fuchs
openaire +1 more source
On the minimal interpolation problem and decoding RS codes
IEEE Transactions on Information Theory, 2000Summary: Some properties of the minimal interpolation problem are investigated, from which a simple proof of the validity of the Welch-Berlekamp algorithm is presented. A new key equation is derived that is closely related to the classical key equation of the syndrome-decoding algorithm and can be solved by the Welch-Berlekamp algorithm.
Xiao Ma 0001, Xinmei Wang
openaire +2 more sources
On the implementation of soft-decision decoding for RS codes
11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications. PIMRC 2000. Proceedings (Cat. No.00TH8525), 2002This paper deals with the hardware implementation of soft decision decoding (SDD) of Reed-Solomon (RS) codes. An efficient algorithm for hardware implementation of generalized minimum distance (GMD) decoding of RS codes is presented and employed in the design of a pilot RS(63,42) codec on FPGAs.
A. Mahmudi +3 more
openaire +2 more sources
Decoding of interleaved RS codes with the Euclidean algorithm
2008 IEEE International Symposium on Information Theory, 2008A novel method for joint decoding of interleaved Reed-Solomon (RS) codes is presented which is based on an extension of the Euclidean algorithm. This method differs from the known multi-sequence shift register algorithms which is shown by an example.
Martin Bossert, Sergey Bezzateev
openaire +1 more source
An Integrated ECC-MAC Based on RS Code
2009This paper presents a message authentication code (MAC) with error-correcting capabilities which can be used for wireless transmission. Also the paper introduces a new nonlinear mixing function `Nmix ' which is cryptographically strong compared to other existing method and secured against linear, differential and other conventional cryptanalysis.
Jaydeb Bhaumik, Dipanwita Roy Chowdhury
openaire +2 more sources
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
The comparative analysis of LDPC and RS code
2011 International Conference on Consumer Electronics, Communications and Networks (CECNet), 2011LDPC code and RS code are error-correcting codes which are researched much more at present, and in the two-dimensional bar code's applications the error correction code plays an important role. In order to accurately identify the two-dimensional bar code, error-correcting code's performance should be further enhanced.
Youan Xiao, Chunling Luo, Chao Yang
openaire +1 more source

