reed-solomon | 易学教程

What is the value of the ideal value of the generator polynomial index in the Schifra library for Reed-Solomon error correcting code?

阅读更多关于 What is the value of the ideal value of the generator polynomial index in the Schifra library for Reed-Solomon error correcting code?

来源： https://stackoverflow.com/questions/57706335/what-is-the-value-of-the-ideal-value-of-the-generator-polynomial-index-in-the-sc

What is the value of the ideal value of the generator polynomial index in the Schifra library for Reed-Solomon error correcting code?

阅读更多关于 What is the value of the ideal value of the generator polynomial index in the Schifra library for Reed-Solomon error correcting code?

来源： https://stackoverflow.com/questions/57706335/what-is-the-value-of-the-ideal-value-of-the-generator-polynomial-index-in-the-sc

Can you please explain Reed Solomon encoding part's Identity matrix?

阅读更多关于 Can you please explain Reed Solomon encoding part's Identity matrix?

问题 I am working on a object storage project where I need to understand Reed Solomon error correction algorithm, I have gone through this Doc as a starter and also some thesis paper. 1. content.sakai.rutgers.edu 2. theseus.fi but I can't seem to understand the lower part of the identity matrix (red box), where it is coming from. How this calculation is done? Can anyone please explain this. 回答1: The encoding matrix is a 6 x 4 Vandermonde matrix using the evaluation points {0 1 2 3 4 5} modified so

Using Reed-Solomon for incremental redundancy

阅读更多关于 Using Reed-Solomon for incremental redundancy

问题 I've been learning error correction mechanisms for very noisy AWGN channels. I've read about Hybrid ARQ systems that use FEC coding in conjunction with ARQ systems which sounds like a good starting point for these type of channels. I was thinking of a setup that follows the next example: First transmission of Packet #1 - RS(38,8) Received a NAK Second transmission of Packet #1 - additional FEC bytes such that at the receiver it gets RS(46,16) Received ACK My question is, is it possible to pre

Reed Solomon Java Library - Partitioning files with redundancy [closed]

阅读更多关于 Reed Solomon Java Library - Partitioning files with redundancy [closed]

问题 Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 5 years ago . I'm looking for Java libraries of the Reed Solomon algorithm. What I need is to partition a given file in different chunks with redundancy. So, after partitioning in N chunks, I can re-build the file with just K of these chunks (Where k < N). This is supposed to be one of the key features of Reed Solomon. This

Basic Reed-Solomon Error Correction Question

阅读更多关于 Basic Reed-Solomon Error Correction Question

问题 Does Reed-Solomon error correction work in an instance where there is a dropped byte (or multiple dropped bytes)? For example, let's say it's a (12,8) Reed Solomon code, so theoretically it should be able to correct 2 errors (or 4 erasures if the position is known). But, what happens if only 11 (or 10) bytes are received and one doesn't know which byte(s) were dropped? Will Reed-Solomon error correction work? Thanks, Ben 回答1: RS decoding for erasures requires the position of the symbols

Basic Reed-Solomon Error Correction Question

阅读更多关于 Basic Reed-Solomon Error Correction Question

Does Reed-Solomon error correction work in an instance where there is a dropped byte (or multiple dropped bytes)? For example, let's say it's a (12,8) Reed Solomon code, so theoretically it should be able to correct 2 errors (or 4 erasures if the position is known). But, what happens if only 11 (or 10) bytes are received and one doesn't know which byte(s) were dropped? Will Reed-Solomon error correction work? Thanks, Ben RS decoding for erasures requires the position of the symbols "dropped" or lost. The kind of error you're talking about is due to phase distortion. You can make it work by

How to apply Reed-Solomon algorithm using zxing in C#

阅读更多关于 How to apply Reed-Solomon algorithm using zxing in C#

I want to transmit binary data over a noisy channel. I read that a good ECC algorithm to detect errors is Reed-Solomon. The problem is i don't understand the input for this algorithm. here is my naive failed attempt with zxing.net: int[] toEncode = { 123,232,432}; var gf = GenericGF.AZTEC_DATA_12; ReedSolomonEncoder rse = new ReedSolomonEncoder(gf); rse.encode(toEncode, 2); ReedSolomonDecoder rsd = new ReedSolomonDecoder(gf); rse.encode(toEncode, 2); please explain to me the input for the encoder and decoder. Is this the implementation you are using here: ReedSolomonEncoder.cs ? If so, to

How to apply Reed-Solomon algorithm using zxing in C#

阅读更多关于 How to apply Reed-Solomon algorithm using zxing in C#

问题 I want to transmit binary data over a noisy channel. I read that a good ECC algorithm to detect errors is Reed-Solomon. The problem is i don't understand the input for this algorithm. here is my naive failed attempt with zxing.net: int[] toEncode = { 123,232,432}; var gf = GenericGF.AZTEC_DATA_12; ReedSolomonEncoder rse = new ReedSolomonEncoder(gf); rse.encode(toEncode, 2); ReedSolomonDecoder rsd = new ReedSolomonDecoder(gf); rse.encode(toEncode, 2); please explain to me the input for the

Addition and multiplication in a Galois Field

阅读更多关于 Addition and multiplication in a Galois Field

问题 I am attempting to generate QR codes on an extremely limited embedded platform. Everything in the specification seems fairly straightforward except for generating the error correction codewords. I have looked at a bunch of existing implementations, and they all try to implement a bunch of polynomial math that goes straight over my head, particularly with regards to the Galois fields. The most straightforward way I can see, both in mathematical complexity and in memory requirements is a