Need help with Reed-Solomon Coding
显示 更早的评论
Hi
I am trying to encode my image with Reed-Solomon code. The code is as below
n = 255;
img = imread('pout.tif');
binary = img > 102;
resized = imresize(binary,[291 247]);
[row k] = size(resized);
gfmsg = gf(resized);
enc = rsenc(gfmsg,n,k);
error = enc + gf(randerr(row,n));
When I run the code, I get an error :
Error using rsenc (line 74)
Symbols in MSG must all have 3 or more bits.
Can you pls help me with this?
采纳的回答
Walter Roberson
2021-4-16
n = 255;
img = imread('pout.tif');
binary = img > 102;
resized = imresize(binary,[291 247]);
[row k] = size(resized);
gfmsg = gf(resized,8);
enc = rsenc(gfmsg,n,k);
error = enc + gf(randerr(row,n),8);
9 个评论
Neeraj Chimwal
2021-4-16
Yes, I specified the galois field order.
You should be considering packing your binary into larger groups, such as
n = 255;
img = imread('pout.tif');
binary = img > 102;
resized = imresize(binary,[296 247]);
r8 = reshape(resized, 8, []);
resized = reshape(2.^(0:7) * r8, [], 247); %8 bits into one byte
[row k] = size(resized);
gfmsg = gf(resized, 8);
enc = rsenc(gfmsg,n,k);
error = enc + gf(randerr(row,n),8);
size(resized)
size(enc)
size(error)
Notice I went slightly larger on the imresize(), to 296 instead of 291, in order to make it a multiple of 8 so that bits could be packed more easily. If the 291 is somehow important, then you could instead pad the bottom of the 291 with 5 rows of zeros and process that, and remove the 5 rows of zeros after the rs decoding.
Neeraj Chimwal
2021-4-17
rsenc() simply refuses to work when the number of bits per item is less than 3.
rsenc() requires that n be at most 2^m-1 where m is the number of bits the gf was built for --- so if we tried m = 3 then n would be at most 2^3-1 = 7.
rsenc() requires that this value, hypothetically 7, be larger than the number of columns of the message, by an even positive integer. If we did not want to pad the message then we must reshape it to have at most 7 minus an even positive integer columns -- so we would have to use 1, 3, or 5 columns, and that number has to divide the number of elements in 291 x 247, so we would have to use either 1 or 3 columns.
With 3 columns that would look like
m = 3;
n = 2^m-1;
img = imread('pout.tif');
binary = img > 102;
resized = imresize(binary,[291 247]);
resized = reshape(resized, [], 3); %3 divides 291 x 247, and we need odd integer < 7 that divides that
[row k] = size(resized)
[row k]
gfmsg = gf(resized,m);
enc = rsenc(gfmsg,n,k);
error = enc + gf(randerr(row,n),m);
size(enc)
size(error)
Could we use 1 column instead? Yes. We can also reduce the number of bits per word to the minimum
m = 3;
n = 3;
img = imread('pout.tif');
binary = img > 102;
resized = imresize(binary,[291 247]);
resized = reshape(resized, [], 1); %1 divides 291 x 247, and we need odd integer < 7 that divides that
[row k] = size(resized);
[row k]
gfmsg = gf(resized,m);
enc = rsenc(gfmsg,n,k);
error = enc + gf(randerr(row,n),m);
size(enc)
size(error)
If you examine the output for this last one, you get rows that are only ever
1 6 8
or
0 0 0
You are encoding k = 1 bit at a time producing 3 bits of output per group, and that means the rows can only be one of those two choices. Using higher n, so generating more bits per group, would increase the resiliance to noise but would still have the property that all the rows were one of two distinct choices.
Neeraj Chimwal
2021-4-17
Walter Roberson
2021-4-17
So that's why you added 8 for galois field order there. m=8 will give n=255.
Exactly. Your code had a target n = 255, and the way to get that is to have m be at least log2(255+1) --> 8.
Your target n must be greater than the number of columns, which you had set to 247.
n is the number of output entries per row.
But each output entry is a integer in the range 0 to 2^m-1 and n must be at least 2^m-1
In order to use n = 255 then m must be at least 8. So 8 bits are being used per entry.
But your binary inputs are all 0 or 1, and the actual data appears at the beginning of each row. So your first 247 entries per row are going to be numeric value 0 or numeric value 1, but you need 8 bits per entry because m = 8. The final (255-247 = 8) entries per row will have some other value in the range 0 to 255, that actually need the full 8 bits.
It seems a bit of a waste, though, to send 291 rows of 255 columns of 8 bit data for which for the first 247 columns, only 1 bit is significant.
From the point of view of a compact message, it makes more sense to take advantage of the fact that with m = 8 that you might as well pack 8 bits of input into each entry that is to be encoded. You get down to 37 rows of 255 entries, each a meaningful 8 bits per entry.
After the decoding you would need to expand the 8 bits per entry into binary. The code I showed with 2.^(0:7) * r8 encodes with weight
1 2 4 8 16 32 64 128
so for example
0 0 1 0 0 1 0 1
would be
0*1 + 0*2 + 1*4 + 0*8 + 0 * 16 + 1*32 + 0*64 + 1*128 = 164 decimal
You might want to reverse the order bits are used in; if so then
resized = reshape(2.^(7:-1:0) * r8, [], 247);
which would give weights
128 64 32 16 8 4 2 1
so
128*0 + 64*0 + 32*1 + 16*0 + 8*0 + 4*1 + 2*0 + 1*1 = 37
This second order is consistent with using dec2bin()
Neeraj Chimwal
2021-4-17
Walter Roberson
2021-4-17
编辑：Walter Roberson
2021-4-17
You cannot use m = 1 because rsenc will not accept anything less than m = 3.
So you would need to use either k = 1 n = 3 or k = 1 n = 5 or k = 1 n = 7, or k = 3 n = 5 or k = 3 n = 7 .
The case k = 1 n = 3, you would be using one logical value from the image, and turning it into something that is logically 3 bits (000 or 001), and when it is encoded it would be followed by two three-bit words. That would give a total of 9 bits per row, and the number of rows would be 291*247 = 71877 for a total of 646893 bits to transmit.
If you pad out to 37 rows of 247 columns, each item a full 8 bit's worth of values, and you use n = 255, then the encoded size would be 37 * 255 with 8 meaningful bits per entry, for a total of 75480 bits to transmit.
Neeraj Chimwal
2021-4-18
更多回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Error Detection and Correction 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
