mudhorn/zxing
1
0
Fork 0
mirror of https://github.com/zxing/zxing.git synced 2025-02-02 05:41:08 -08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Undo optimization that seems to not be correct in all cases -- will have to evaluate again later

Browse source 
git-svn-id: https://zxing.googlecode.com/svn/trunk@312 59b500cc-1b3d-0410-9834-0bbf25fbcc57
This commit is contained in:
srowen 2008-03-26 14:13:14 +00:00
parent c32827af04
commit 5f1428308d
1 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
core/src/com/google/zxing/common/reedsolomon/ReedSolomonDecoder.java
View file

@ -138,9 +138,9 @@ public final class ReedSolomonDecoder {
private int[] findErrorLocations(GF256Poly errorLocator) throws ReedSolomonException {
// This is a direct application of Chien's search
int numErrors = errorLocator.getDegree();
if (numErrors == 1) { // shortcut
return new int[] { errorLocator.getCoefficient(1) };
}
//if (numErrors == 1) { // shortcut
// return new int[] { errorLocator.getCoefficient(1) };
//}
int[] result = new int[numErrors];
int e = 0;
for (int i = 1; i < 256 && e < numErrors; i++) {
@ -158,9 +158,9 @@ public final class ReedSolomonDecoder {
private int[] findErrorMagnitudes(GF256Poly errorEvaluator, int[] errorLocations) {
// This is directly applying Forney's Formula
int s = errorLocations.length;
if (s == 1) { // shortcut
return new int[] { errorEvaluator.getCoefficient(0) };
}
//if (s == 1) { // shortcut
// return new int[] { errorEvaluator.getCoefficient(0) };
//}
int[] result = new int[s];
for (int i = 0; i < s; i++) {
int xiInverse = field.inverse(errorLocations[i]);