Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 94 for “"Reed-Solomon codes"”.

  1. Efficient soft decoding techniques for reed-solomon codes

    … is on finding efficient decoding methods for Reed-Solomon (RS) codes, i.e., algorithms with acceptable performance and affordable complexity. Three classes of decoders are considered including sphere decoding, belief propagation decoding and interpolation-based decoding. Originally proposed …

    concordia Download PDF for Efficient soft decoding techniques for reed-solomon codes (opens in a new tab)

  2. Algorithms and Architectures for Soft -Decoding Reed -Solomon Codes

    Finally, the applicability of soft-decoding for disk-drive applications is studied. Based on performance improvements and complexity requirements, generalized minimum distance decoding with maximum a priori soft-detection is selected, and the corresponding architecture is developed. The generalized …

    uiuc Repository record for Algorithms and Architectures for Soft -Decoding Reed -Solomon Codes (opens in a new tab)

  3. A CSMA/CD portable data system using Reed-Solomon codes

    This thesis presents a low-cost Carrier-sense-multiple-access/Collision detection portable data system [i.e. a wireless data network] for indoor applications.

    concordia Download PDF for A CSMA/CD portable data system using Reed-Solomon codes (opens in a new tab)

  4. On the performance of Trellis coded 8PSK with Reed Solomon codes

    Concatenated Trellis coded 8PSK with Reed Solomon (RS) codes is studied over A WGN and Rayleigh fading channels. Trellis coded modulation (TCM) achieves a high coding gain without any bandwidth expansion. The basic analysis of its performance is reviewed and confirmed by simulation using a …

    uvic Repository record for On the performance of Trellis coded 8PSK with Reed Solomon codes (opens in a new tab)

  5. Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes

    … for Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error radius within which the soft-decision decoder produces a list that contains the transmitted codeword. The error radius for ASD is shown to …

    maryland Repository record for Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes (opens in a new tab)

  6. PARALLEL SUBSPACE SUBCODES OF REED-SOLOMON CODES FOR MAGNETIC RECORDING CHANNELS

    … architectures using an LDPC code plus a Reed-Solomon (RS) code lower the error-floor at high signal-to-noise ratio (SNR) at the price of a reduced coding gain and a less sharp waterfall region at lower SNR. This architecture fails to deal with the error floor problem when the number of …

    oklahoma-thes Repository record for PARALLEL SUBSPACE SUBCODES OF REED-SOLOMON CODES FOR MAGNETIC RECORDING CHANNELS (opens in a new tab)

  7. ON FAST DECODING ALGORITHMS FOR LOW-ERROR-CORRECTING-CAPABILITY REED-SOLOMON CODES

    … for low error correcting capability RS (Reed-Solomon) codes. By studying the properties of DBEC-TBED (Double-Byte-Error-Correction & Triple-Byte-Error-Detection) RS codes, we derive a very simple algorithm for finding the error locator polynomial of such codes. By testing the weight of …

    nus Repository record for ON FAST DECODING ALGORITHMS FOR LOW-ERROR-CORRECTING-CAPABILITY REED-SOLOMON CODES (opens in a new tab) Download file for ON FAST DECODING ALGORITHMS FOR LOW-ERROR-CORRECTING-CAPABILITY REED-SOLOMON CODES (opens in a new tab)

  8. Generalized Skew Reed-Solomon Codes and Other Applications of Skew Polynomial Evaluation

    … thesis studies the theory of error-correcting codes based on evaluation of skew polynomials. Skew polynomials are a noncommutative generalization of ordinary polynomials that, in recent years, have found applications in coding theory and cryptography. The evaluation of skew polynomials is …

    toronto-retro Repository record for Generalized Skew Reed-Solomon Codes and Other Applications of Skew Polynomial Evaluation (opens in a new tab)

  9. On Decoding Reed -Solomon Codes Up to and Beyond the Packing Radii

    The (24, 12, 8) binary Golay code is proved to be a subfield subcode of a code constructed on the Klein quartic over GF(2 3).

    uiuc Repository record for On Decoding Reed -Solomon Codes Up to and Beyond the Packing Radii (opens in a new tab)

  10. Multiple layered Reed-Solomon codes in audio disks with a feedback system

    … study the performance of powerful multilayered Reed-Solomon error-correcting coding applied to audio disks to protect data from errors. A detailed analysis of the performance of four layers of Reed-Solomon coding is addressed in presence of burst errors. The application of Reed-Solomon coding in …

    uiuc Repository record for Multiple layered Reed-Solomon codes in audio disks with a feedback system (opens in a new tab)

  11. Complete Weight enumerators and probability of undetected error for some Reed-Solomon codes

    The Hamming weight enumerators for Reed-Solomon codes are known, but do not often adequately describe the structure of the codes. Complete weight enumerators, on the other hand, describe the code in more detail, but are more difficult to determine. A procedure described by Blake and Kith [1] is …

    ubc Repository record for Complete Weight enumerators and probability of undetected error for some Reed-Solomon codes (opens in a new tab) Download PDF for Complete Weight enumerators and probability of undetected error for some Reed-Solomon codes (opens in a new tab)

  12. Improved iterative detection techniques for slow-frequency-hop communications with Reed-Solomon codes

    … packet radio system using interleaved Reed-Solomon codes and per-dwell differential encoding. A per-dwell soft-input-soft-output detector along with successive-erasures decoding results in a system that performs better than previously considered detection techniques in the presence of …

    clemson Repository record for Improved iterative detection techniques for slow-frequency-hop communications with Reed-Solomon codes (opens in a new tab)

  13. Hybrid hard and soft decision decoding of Reed-Solomon codes for M-ARY frequency-shift keying

    … is a mature technology for convolutional codes, practical soft decision decoding for the commonly used Reed-Solomon (RS) non-binary block code has only recently been developed and is currently limited to use with bandwidth efficient modulation schemes such as M-ary phase-shift keying. …

    nps Repository record for Hybrid hard and soft decision decoding of Reed-Solomon codes for M-ARY frequency-shift keying (opens in a new tab)

  14. Studies on Deep Holes and Discrete Logarithms

    Error-correcting codes and cryptography are two important areas related to information communication. Generalized Reed-Solomon codes and cryptosystems based on the discrete logarithm problem are important representatives of these two fields, respectively. For a linear code, deep holes are defined …

    oklahoma-thes Repository record for Studies on Deep Holes and Discrete Logarithms (opens in a new tab)

  15. The Original View of Reed-Solomon Coding and the Welch-Berlekamp Decoding Algorithm

    Reed-Solomon codes are a class of maximum distance separable error correcting codes with known fast error correction algorithms. They have been widely used to assure data integrity for stored data on compact discs, DVDs, and in RAID storage systems, for digital communications channels such as DSL …

    arizona-thes Repository record for The Original View of Reed-Solomon Coding and the Welch-Berlekamp Decoding Algorithm (opens in a new tab)

Page 1 of 5