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.
Maximum distance separable (MDS) erasure codes are widely used in distributed storage systems (DSS) for better storage efficiency and protection against Byzantine attacks. In this paper, we aim at enhancing the error-correction capacity of DSS in a hostile network. Firstly, we apply Hermitian code in DSS and presented a special placing mode for the encoded symbols. A reconstruction algorithm in error-free...
In 2002, Wong-Wang-Wing presented a verifiable redistributing secret shares protocol, where the new parties must have been honest. They used Feldman's Verifiable Secret Sharing scheme, which assumed that the discrete logarithm is hard. In 2013, Nojoumian and Stinson presented information-theoretically (unconditionally) secure schemes under assumption that at most t out of 4t+1 parties are actively...
Energy consumption in sensor nodes and Link reliability are two of the major challenges in Wireless Sensor Networks (WSNs). The data exchanged between nodes and base station are vulnerable to corruption by errors induced by random noise, signal fading and other factors. In this regard, error control coding (ECC) is an efficient technique used to increase link reliability and to reduce the required...
Multiple description coding has emerged as an attractive framework for robust transmission of multimedia information over packet loss and fading wireless channels. Forward error correction (FEC) based multiple description coding enables generation of an arbitrary number of descriptions from a progressive image bitstream. These descriptions are formed using erasure protection properties of Reed-Solomon...
The creation of Ultra-Wideband (UWB) radio platform has allowed the development of high bit-rate Wireless USB. Reed-Solomon (RS) code is employed in order to improve decoding at the receiver offering good reliability performance in the mobile environment. This paper presents shorten RS (23, 17) code solutions for Wireless USB system encoding/decoding needs. The result is tested from simulation in...
The current distributed storage systems mainly rely on data replication to ensure certain level of data availability and reliability. A recent trend is to introduce erasure codes into the distributed storage. Inspired by the RAID system, early attempts have been focused on designing Reed-Solomon (RS) based solutions and other block codes including Low Density Parity Check (LDPC) codes. This paper...
In the (ρr, ρw)-adversarial wiretap (AWTP) channel model of [13], a codeword sent over the communication channel is corrupted by an adversary who observes a fraction ρr of the codeword, and adds noise to a fraction ρw of the codeword. The adversary is adaptive and chooses the subsets of observed and corrupted components, arbitrarily. In this paper we give the first efficient construction of a code...
Reed-Solomon convolutional concatenated (RSCC) codes have been widely used in wireless and space communications. Turbo decoding of the concatenated code has been recently developed and shown that the code's error-correction capability can be significantly improved. Particularly, turbo decoding of RSCC codes yields a competent performance when the codeword length is limited. This makes the code a very...
Reed-Solomon codes are widely used to provide reliable communication, as they are well known for their high data correction rates. However, techniques that best optimize hardware area as well as signal propagation delays are needed in today's applications. In this work, two techniques are investigated and implemented using a hardware description language, synthesized to a XUPV5-LX110t development...
In this paper, we present a new basis of polynomial over finite fields of characteristic two and then apply it to the encoding/decoding of Reed-Solomon erasure codes. The proposed polynomial basis allows that h-point polynomial evaluation can be computed in O(hlog2(h)) finite field operations with small leading constant. As compared with the canonical polynomial basis, the proposed basis improves...
Models of error-correcting coding (Reed-Solomon codes, LT-codes) are realized. Interference affecting the quality of the signal transmission through the data channel is also realized. The results of the various characteristics of code with different encoding methods, when changing the redundancy of Reed-Solomon code, when changing the encoding parameters of code LT, the transmission results obtained...
Response Code (QR code) is widely used in daily life in recent years because it has high capacity encoding of data, damage resistance, fast decoding and other good characteristics. Since it is popular, people can use it to transmit secret information without inspection. The development of steganography in QR code lead to many problems arising. How to keep the original content of QR code and embed...
Reliability has become one of the most vital requirements in wireless sensor networks (WSNs). One efficient way to increase the reliability is by using erasure coding techniques such as Reed-Solomon/Cauchy Reed-Solomon. The problem is the time required for encoding and decoding the data words, especially when large amount of data need to be sent like in complex WSN applications. In this paper, we...
This paper presents an efficient approach to verifying higher-degree Galois-Field(GF) arithmetic circuits. The proposed method describes GF arithmetic circuits by graph-based representation, and verifies them by a combination of algebraic method with a new verification method based on natural deduction for the first-order predicate logic with equal sign. The natural deduction method can verify kind...
The performance of Polar codes has been proved to achieve the Shannon capacity when N, the block length, tends to infinity. However, finite block length performance of Polar codes is rather poor compared to other capacity approaching codes such as LDPC (Low-Density Parity-Check) codes. In this paper, we propose a concatenated scheme with a polar code as an inner code and a Reed-Solomon code as an...
This paper presents a design of syndrome computation block for Reed-Solomon decoder for RS (255, 239) code. For calculating the syndromes, three-parallel processing has been used. Parallelizing allow inputs to be received at very high rates and outputs to be delivered at correspondingly high rates with minimum delay. RS (255, 239) code consists of 255 symbols which are multiple of 3. So three symbols...
The implementation of Reed-Solomon encoder and decoder for RS(255,239) is proposed. Reed-Solomon codes are used for error detection and correction for reliable communication on noisy channel. Error correction codes are also known as forward error correction codes because it avoids the back-channel or retransmission of data. So, Reed-Solomon codes are preferred for error checking. The main part of...
The problem of efficient soft-decision decoding of Reed-Solomon codes is considered. Low-complexity sequential algorithm was recently proposed for decoding of polar codes. A generalization of this algorithm to the case of Reed-Solomon codes, represented as polar codes with dynamic frozen symbols, is proposed. Simplification of the proposed decoding algorithm to the case of transmission of binary image...
Multiuser cooperative schemes usually rely on relay selection or channel selection to avoid deep fading and achieve diversity for all source nodes while maintaining acceptable spectral efficiency. This requires estimating the channel state information (CSI) and reporting it back to the resource allocator. Then the resource allocator needs to inform each node about its task. In some applications, it...
In this paper, soft-input/soft-output decoding of an arbitrary linear block error correction code over any finite field is performed by transforming an algebraic description of the decoding problem to a binary message passing decoding problem, such as used for a binary LDPC decoder. Field symbols are represented using a Hadamard-like transform of the probability distribution over the field, and field...
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.