FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2063008281> ?p ?o ?g. }

• W2063008281 abstract "Reed-Solomon (RS) codes are powerful error-correcting codes that can be found in a wide variety of digital communications and digital data-storage systems. Classical hard decoder of RS code can correct t = (dmin -1) /2 errors where dmin = (n k+ 1) is the minimum distance of the codeword, n is the length of codeword and k is the dimension of codeword. Maximum likelihood decoding (MLD) performs better than the classical decoding and therefore how to approach the performance of the MLD with less complexity is a subject which has been researched extensively. Applying the bit reliability obtained from channel to the conventional decoding algorithm is always an efficient technique to approach the performance of MLD, although the exponential increase of complexity is always concomitant. It is definite that more enhancement of performance can be achieved if we apply the bit reliability to enhanced algebraic decoding algorithm that is more powerful than conventional decoding algorithm. In 1997 Madhu Sudan, building on previous work of Welch-Berlekamp, and others , discovered a polynomial-time algorithm for decoding low-rate ReedSolomon codes beyond the classical error-correcting bound t = (dmin -1) /2 . Two years later Guruswami and Sudan published a significantly improved version of Sudan's algorithm (GS), but these papers did not focus on devising practical implementation. The other authors , Kotter, Roth and Ruckenstein, were able to find realizations for the key steps in the GS algorithm, thus making the GS algorithm a practical instrument in transmission systems. The Gross list algorithm, which is a simplified one with less decoding complexity realized by a reencoding scheme, is also taken into account in this dissertation. The fundamental idea of the GS algorithm is to take advantage of an interpolation step to get an interpolation polynomial produced by support symbols, received symbols and their corresponding multiplicities. After that the GS algorithm implements a factorization step to find the roots of the interpolation polynomial. After comparing the reliability of these codewords which are from the output of factorization, the GS algorithm outputs the most likely one. The support set, received set and multiplicity set are created by KoetterVardy (KV) front end algorithm. In the GS list decoding algorithm, the number of errors that can be corrected increases to tcs = n 1 lJ (k 1) n J. It is easy to show that the GS list decoding algorithm is capable of correcting more errors than a conventional decoding algorithm. In this dissertation, we present two hybrid list decoding and Chase-like algorithms. We apply the Chase algorithms to the KV soft-decision front end. Consequently, we are able to provide a more reliable input to the KV list algorithm. In the application of Chase-like algorithm, we take two conditions into consideration, so that the floor cannot occur and more coding gains are possible. With an increase of the bits that are chosen by the Chase algorithm, the complexity of the hybrid algorithm increases exponentially. To solve this problem an adaptive algorithm is applied to the hybrid algorithm based on the fact that as signal-to-noise ratio (SNR) increases the received bits are more reliable, and not every received sequence needs to create the fixed number of test error patterns by the Chase algorithm. We set a threshold according to the given SNR and utilize it to finally decide which unreliable bits are picked up by Chase algorithm. However , the performance of the adaptive hybrid algorithm at high SNRs decreases as the complexity decreases. It means that the adaptive algorithm is not a sufficient mechanism for eliminating the redundant test error patterns. The performance of the adaptive hybrid algorithm at high SNRs motivates us to find out another way to reduce the complexity without loss of performance. We would consider the two following problems before dealing with the problem on hand. One problem is: can we find a terminative condition to decide which" @default.
• W2063008281 created "2016-06-24" @default.
• W2063008281 creator A5017256612 @default.
• W2063008281 date "2005-01-01" @default.
• W2063008281 modified "2023-09-27" @default.
• W2063008281 title "The hybrid list decoding and Chase-like algorithm of Reed-Solomon codes." @default.
• W2063008281 cites W1594652978 @default.
• W2063008281 cites W1607705207 @default.
• W2063008281 cites W16610711 @default.
• W2063008281 cites W2013392609 @default.
• W2063008281 cites W2016833807 @default.
• W2063008281 cites W2023355697 @default.
• W2063008281 cites W2024774668 @default.
• W2063008281 cites W2040075573 @default.
• W2063008281 cites W2100852839 @default.
• W2063008281 cites W2102196824 @default.
• W2063008281 cites W2110742739 @default.
• W2063008281 cites W2115044769 @default.
• W2063008281 cites W2120233256 @default.
• W2063008281 cites W2122493145 @default.
• W2063008281 cites W2122685617 @default.
• W2063008281 cites W2130394852 @default.
• W2063008281 cites W2132082142 @default.
• W2063008281 cites W2133402830 @default.
• W2063008281 cites W2137393084 @default.
• W2063008281 cites W2138779125 @default.
• W2063008281 cites W2155020285 @default.
• W2063008281 cites W2155316710 @default.
• W2063008281 cites W2158558186 @default.
• W2063008281 cites W2162442687 @default.
• W2063008281 cites W2162725776 @default.
• W2063008281 cites W2168932491 @default.
• W2063008281 cites W2212601038 @default.
• W2063008281 cites W2752885492 @default.
• W2063008281 cites W311000671 @default.
• W2063008281 cites W42469326 @default.
• W2063008281 hasPublicationYear "2005" @default.
• W2063008281 type Work @default.
• W2063008281 sameAs 2063008281 @default.
• W2063008281 citedByCount "0" @default.
• W2063008281 crossrefType "dissertation" @default.
• W2063008281 hasAuthorship W2063008281A5017256612 @default.
• W2063008281 hasConcept C11413529 @default.
• W2063008281 hasConcept C132727834 @default.
• W2063008281 hasConcept C153207627 @default.
• W2063008281 hasConcept C157125643 @default.
• W2063008281 hasConcept C177264268 @default.
• W2063008281 hasConcept C193969084 @default.
• W2063008281 hasConcept C199360897 @default.
• W2063008281 hasConcept C204397858 @default.
• W2063008281 hasConcept C2776760102 @default.
• W2063008281 hasConcept C33923547 @default.
• W2063008281 hasConcept C41008148 @default.
• W2063008281 hasConcept C57273362 @default.
• W2063008281 hasConcept C78065487 @default.
• W2063008281 hasConcept C78944582 @default.
• W2063008281 hasConceptScore W2063008281C11413529 @default.
• W2063008281 hasConceptScore W2063008281C132727834 @default.
• W2063008281 hasConceptScore W2063008281C153207627 @default.
• W2063008281 hasConceptScore W2063008281C157125643 @default.
• W2063008281 hasConceptScore W2063008281C177264268 @default.
• W2063008281 hasConceptScore W2063008281C193969084 @default.
• W2063008281 hasConceptScore W2063008281C199360897 @default.
• W2063008281 hasConceptScore W2063008281C204397858 @default.
• W2063008281 hasConceptScore W2063008281C2776760102 @default.
• W2063008281 hasConceptScore W2063008281C33923547 @default.
• W2063008281 hasConceptScore W2063008281C41008148 @default.
• W2063008281 hasConceptScore W2063008281C57273362 @default.
• W2063008281 hasConceptScore W2063008281C78065487 @default.
• W2063008281 hasConceptScore W2063008281C78944582 @default.
• W2063008281 hasLocation W20630082811 @default.
• W2063008281 hasOpenAccess W2063008281 @default.
• W2063008281 hasPrimaryLocation W20630082811 @default.
• W2063008281 hasRelatedWork W1866038923 @default.
• W2063008281 hasRelatedWork W1972078940 @default.
• W2063008281 hasRelatedWork W1974054218 @default.
• W2063008281 hasRelatedWork W1975709480 @default.
• W2063008281 hasRelatedWork W2005580368 @default.
• W2063008281 hasRelatedWork W2010604914 @default.
• W2063008281 hasRelatedWork W2025843414 @default.
• W2063008281 hasRelatedWork W2027498302 @default.
• W2063008281 hasRelatedWork W2077165991 @default.
• W2063008281 hasRelatedWork W2097503925 @default.
• W2063008281 hasRelatedWork W2104653774 @default.
• W2063008281 hasRelatedWork W2128068164 @default.
• W2063008281 hasRelatedWork W2142877975 @default.
• W2063008281 hasRelatedWork W2149639327 @default.
• W2063008281 hasRelatedWork W2153697125 @default.
• W2063008281 hasRelatedWork W2155670728 @default.
• W2063008281 hasRelatedWork W2160839632 @default.
• W2063008281 hasRelatedWork W2541661803 @default.
• W2063008281 hasRelatedWork W2963436446 @default.
• W2063008281 hasRelatedWork W2013901888 @default.
• W2063008281 isParatext "false" @default.
• W2063008281 isRetracted "false" @default.
• W2063008281 magId "2063008281" @default.
• W2063008281 workType "dissertation" @default.