The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we are interested to the decoding of blocks turbo codes constructed from Reed Solomon (RS) codes. We have modified the iterative algorithm proposed by Chase in order to exploit the a priori information provided by a correlated source. Indeed, some sources such as images have a strong correlation. A simple iterative decoding algorithm does not take this feature into account. The choice...
This work proposes a decoder implementation for high-rate generalized concatenated (GC) codes. The proposed codes are well suited for error correction in flash memories for high reliability data storage. The GC codes are constructed from inner extended binary Bose-Chaudhuri-Hocquenghem (BCH) codes and outer Reed-Solomon (RS) codes. The extended BCH codes enable high-rate GC codes. Moreover, the decoder...
The Parity check Transformation Algorithm (PTA) is a recently developed symbol wise soft decision decoding algorithm for Reed Solomon codes. The algorithm has been shown in literature to outperform widely used Reed Solomon decoders including the Koetter and Vardy (KV) algorithm. The PTA gets its name from the fact that it transforms the parity check matrix of the Reed Solomon code after every iteration...
Article justifies a term of “assessment of infrmation efficiency of error-correcting codes”. It describes a model of descrete communication channel with parameters, which are nessesary for assessment of information efficiency. Authors provide a methodology of comprehensive assessment of information efficiency based on Varshamov-Gilbert, Plotkin and Shannon bounds. Made an assessment of information...
We consider error correction by maximum distance separable (MDS) codes based on a part of the received codeword. Our problem is motivated by applications in distributed storage. While efficiently correcting erasures by MDS storage codes (the “repair problem”) has been widely studied in recent literature, the problem of correcting errors in a similar setting seems to represent a new question in coding...
In this paper we show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated (U | U + V) constructions with algebraic geometry (AG) code components. These codes are decoded with a recursive computation of the a posteriori probabilities of the code symbols together with decoding the AG components with the Koetter-Vardy algorithm. We...
Deployed in various distributed storage systems, erasure coding has demonstrated its advantages of low storage overhead and high failure tolerance. Typically in an erasure-coded distributed storage system, systematic maximum distance seperable (MDS) codes are chosen since the optimal storage overhead can be achieved and meanwhile data can be read directly without decoding operations. However, data...
With the advent of QR readers and mobile phones the use of graphical codes like QR codes and data matrix code has become very popular. Despite the noise like appearance, it has the advantage of high data capacity, damage resistance and fast decoding robustness. The proposed system embeds the image chosen by the user to develop visually appealing QR codes with improved decoding robustness using BCH...
In the tornado code, cascading with traditional erasure codes (mostly Reed-Solomon codes) is always used to protect the last level, which will enhance the erasure correcting performance. However, this method increases the complexity in the process of encoding and decoding. In this paper, we introduce an improved algorithm to get linear coding complexity and simplify the implementation of decoder in...
Error-correcting codes make possible reliable communication over noisy channels. One way to guarantee the correct implementation of error-correcting codes is to use formal verification. This requires in particular the formalization of the mathematical theory of error-correcting codes. This has been made possible by recent advances in the formalization of mathematics using proof-assistants. In this...
This paper proposes a low-complexity high performance soft-in hard-out decoding algorithm for Reed-Solomon (RS) codes. The Guruswami-Sudan (GS) algebraic list decoding algorithm can correct errors beyond half the distance bound by performing a curve-fitting decoding process. However, its extra error-correction capability is exchanged with a high computational cost which is dominated by the interpolation...
In this paper we propose a generalized concatenated code (GC code) construction based on shortened Reed-Solomon inner codes and nonbinary LDPC outer codes. We also propose a soft-input decoder for this construction that makes use of soft-input soft-output decoding of both inner and outer codes. We show that this construction gives significant coding gain. We also compared it to generalized error-location...
This article is described to research of noise stability providing different methods of data communication net-works as a part of control systems. Importance and significance of redundancy encoding and feedback for pro-viding reliable information transfer between elements and devised of control systems are showing. The analytic methods of redundancy codes (Reed-Solomon and convolution) construction,...
This paper proposes an area efficient and low power Reed-Solomon (RS) decoder. The proposed decoder is designed using eight stage arithmetic pipelined architecture. The pipelined architecture of RS decoder performs the detection of error locator from the input stream and computes the error magnitude polynomial using the Berleykamp Massey's algorithm. The evaluation of error locator and computation...
In this paper, we propose the encoding and list decoding method of polar codes based on the four-dimensional Reed-Solomon (RS-4) kernel. In specific, an encoding table based method is employed to reduce the computational complexity of both encoder and decoder. In addition, a simplified method to update log-likelihood ratios (LLRs) which employs additions instead of exponential calculations is also...
This paper presents an implementation of a colored 2D-barcode which is based on the structure of the CQR Code (Colored Quick Response Code). While the first version of the CQR Code (CQR Code-5) is a 2-D barcode of 5 colors, this new version (CQR Code-9) has 9 colors. In this paper we describe the implementation details of this new CQR Code. This new version of the CQR Code can store up to 2,048 information...
We construct balanced and sparsest generator matrices for cyclic Reed-Solomon codes with any length n and dimension k. By sparsest, we mean that each row has the least possible number of nonzeros, while balanced means that the number of nonzeros in any two columns differs by at most one. Codes allowing such encoding schemes are useful in distributed settings where computational load-balancing is critical...
The article describes an innovative bit error rate reduction technique principle and its practical implementation. The design of the technique is implemented in an FPGA and is combined with other more conventional BER reduction techniques, such as Reed-Solomon coding. Experimental results are provided. The application bit rate in function of BER for both reliable (TCP) and unreliable (UDP) mode of...
The principles of construction of Reed-Solomon codes are examined. Analysis of the basic parameters of the codes was perfomed. Comprehensive assessment of correcting abilities of the code along with the information efficiency is made. Performed a comparison of efficiency of Reed-Solomon codes in telecommunication networks compared to binary codes which have equivalent parameters.
Compressed Sensing (CS) is an emerging field in communications and mathematics that is used to measure few measurements of long sparse vectors with the ability of lossless reconstruction. In this paper we use results from channel coding to design a recovery algorithm for CS with a deterministic measurement matrix by exploiting error correction schemes. In particular, we show that a generalized Reed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.