Questions tagged [reed-solomon]

"Reed-Solomon" codes are a set of error-correcting codes used in media and communication.

105 questions
0
votes
0 answers

Is there a way to Forward Error Correct (FEC RS) an Alphabet of 36 chars?

Case: We want to Encode an 8 Character code to 10 Character code with adding 2 Forward Error Correcting Reed-Solomon Characters(so suffix 2 Error Correcting Chars). Example Code I'm using this Library C# FEC Reed-Solomon Library. I'm having a…
0
votes
1 answer

Row reducing a matrix (not using sympy.rref)

I have a matrix, G (size PxN), and I would like to make the first N/2 columns of G form the N/2×N/2 identity matrix by row operations. Any idea how I could write code for this? (not using sympy.rref). Note P is a prime number slightly larger than…
AE93
  • 155
  • 8
0
votes
1 answer

Can the Euclid algorithm be used to do Reed Solomon decoding for the more general case where b > 1 in WHP 031?

I have been attempting to understand how to decode the following RS(7,3) code (prim Poly = 1011, prim Elem = 2, b = 2) per the Euclid algo described in WHP 031 previously linked to on the wikipedia page here: …
Sean
  • 35
  • 2
0
votes
1 answer

Welch-Berlekamp Algorithm for Reed Solomon code as nonbinary BCH code

I am familiar with RS codes and the classic syndrome-based decoding algorithm. However, I now have the task of implementing an alternative decoder, the Welch-Berlekamp algorithm. Here, the underlying application requires that no syndrome computation…
0
votes
1 answer

Python erasure coding library that can handle larger strings?

I'm looking for an python erasure coding library that works for larger inputs. So far I've checked out: unireedsolomon: fails for 256-byte inputs, unmaintained reedsolo/reedsolomon: fails for a 300-byte input silently. Reed-Solomon clearly a…
Zachary Vance
  • 752
  • 4
  • 18
0
votes
2 answers

Speeding up Berlekamp Welch algorithm using FFT for Shamir Secret Share

I believe the Berlekamp Welch algorithm can be used to correctly construct the secret using Shamir Secret Share as long as $t
Ordinary
  • 11
  • 1
0
votes
1 answer

Reed-Solomon Code for large code length and errors

I'm new to Error Correction Code (ECC). Take the Reed-Solomon code (RS(n,k)) as an example, it encodes k symbols into n symbols with n-k parity symbols and it can correct (n-k)/2 error symbols. I want to know whether there is design or…
Tracy Hu
  • 5
  • 2
0
votes
2 answers

Reed-Solomon detection capability

I am interested on the analysis of the Reed-Solomon capabilities for detection (detection only, when correction is not possible), in particular for RS(10,8), with symbol 8 bits, 10 symbols total in a codeword, out of which 8 are for data and 2 for…
Max Bonino
  • 33
  • 4
0
votes
1 answer

Is there a way to generalize this Reed-Solomon encoder/decoder?

I'm trying to construct a [7,4,4] RS code with primitive polynomial 0x3f3 (1+x+x^3) over GF(8), using the library https://github.com/lrq3000/unireedsolomon Upon initializing the encoder with the command coder = rs.RSCoder(7,4, prim = 0x3f3, c_exp =…
Heisenberg
  • 19
  • 2
0
votes
1 answer

choosing the galois field for reed-solomon encoding

What determines the size of galois field when using reed-solomon algorithm to encode an arbitrary message of any size? Is it the symbol size, or the size of the message? For example, if I am to encode ASCII characters, and I use GF(2^8) because…
Xiangcai
  • 11
  • 4
0
votes
1 answer

Error correcting codes for short (7-10 bits) windowed reads from cyclic tapes

I have an array of N bits written on a cyclic tape. I read a sequence of M symbols starting from a random place on the tape. I was thinking about Reed Solomon error correction trying all possible starting points of the message, but all RS…
0
votes
1 answer

Reed-Solomon Code with Python3 for a large data

I'm making a code to encode the 10MB Binary Data using Reed-Solomon Code. But, the module throws the error about message length like the following warning. ValueError: Message is too long (10032003 when max is 255) I've tried to understand the…
JIN
  • 149
  • 2
  • 10
0
votes
1 answer

Reed solomon how many missing bytes can be corrected?

I have simple question? I have Data of 256 bytes including 32 parity bytes. If I receive only 223 bytes including the 32 parity bytes. Am I still able to recover the 256 Block? If not, what if i know the location of the missing bytes?
0
votes
1 answer

Why error-only decoding has high miscorrection rate for small parity?

I've a question regarding to a statement written in this paper, "Generalized Integrated Interleaved Codes". The paper mentions that erasure decoding of Reed-Solomon (RS) code incurs no miscorrection, but error-only decoding of RS code incurs a high…
0
votes
1 answer

Why RS(255,233) has 32 redundant symbols?

How does Reed Solomon code(255,233) is formed? I understand how RS(255,223) is formed because n=2^8-1=255 r=32, k=n-r=223 but how about RS(255,233)? I read somewhere on the internet, it says RS(255,233) has 32 redundant symbols but why? Isn't it…