/**
 * Corrects the parameter bits using Reed-Solomon algorithm.
 *
 * @param parameterData parameter bits
 * @param compact true if this is a compact Aztec code
 * @throws NotFoundException if the array contains too many errors
 */
private static int getCorrectedParameterData(long parameterData, boolean compact) throws NotFoundException {
  int numCodewords;
  int numDataCodewords;

  if (compact) {
    numCodewords = 7;
    numDataCodewords = 2;
  } else {
    numCodewords = 10;
    numDataCodewords = 4;
  }

  int numECCodewords = numCodewords - numDataCodewords;
  int[] parameterWords = new int[numCodewords];
  for (int i = numCodewords - 1; i >= 0; --i) {
    parameterWords[i] = (int) parameterData & 0xF;
    parameterData >>= 4;
  }
  try {
    ReedSolomonDecoder rsDecoder = new ReedSolomonDecoder(GenericGF.AZTEC_PARAM);
    rsDecoder.decode(parameterWords, numECCodewords);
  } catch (ReedSolomonException ignored) {
    throw NotFoundException.getNotFoundInstance();
  }
  // Toss the error correction.  Just return the data as an integer
  int result = 0;
  for (int i = 0; i < numDataCodewords; i++) {
    result = (result << 4) + parameterWords[i];
  }
  return result;
}
 

/**
 * Corrects the parameter bits using Reed-Solomon algorithm.
 *
 * @param parameterData parameter bits
 * @param compact true if this is a compact Aztec code
 * @throws NotFoundException if the array contains too many errors
 */
private static int getCorrectedParameterData(long parameterData, boolean compact) throws NotFoundException {
  int numCodewords;
  int numDataCodewords;

  if (compact) {
    numCodewords = 7;
    numDataCodewords = 2;
  } else {
    numCodewords = 10;
    numDataCodewords = 4;
  }

  int numECCodewords = numCodewords - numDataCodewords;
  int[] parameterWords = new int[numCodewords];
  for (int i = numCodewords - 1; i >= 0; --i) {
    parameterWords[i] = (int) parameterData & 0xF;
    parameterData >>= 4;
  }
  try {
    ReedSolomonDecoder rsDecoder = new ReedSolomonDecoder(GenericGF.AZTEC_PARAM);
    rsDecoder.decode(parameterWords, numECCodewords);
  } catch (ReedSolomonException ignored) {
    throw NotFoundException.getNotFoundInstance();
  }
  // Toss the error correction.  Just return the data as an integer
  int result = 0;
  for (int i = 0; i < numDataCodewords; i++) {
    result = (result << 4) + parameterWords[i];
  }
  return result;
}
 

/**
 * Corrects the parameter bits using Reed-Solomon algorithm.
 *
 * @param parameterData parameter bits
 * @param compact true if this is a compact Aztec code
 * @throws NotFoundException if the array contains too many errors
 */
private static int getCorrectedParameterData(long parameterData, boolean compact) throws NotFoundException {
  int numCodewords;
  int numDataCodewords;

  if (compact) {
    numCodewords = 7;
    numDataCodewords = 2;
  } else {
    numCodewords = 10;
    numDataCodewords = 4;
  }

  int numECCodewords = numCodewords - numDataCodewords;
  int[] parameterWords = new int[numCodewords];
  for (int i = numCodewords - 1; i >= 0; --i) {
    parameterWords[i] = (int) parameterData & 0xF;
    parameterData >>= 4;
  }
  try {
    ReedSolomonDecoder rsDecoder = new ReedSolomonDecoder(GenericGF.AZTEC_PARAM);
    rsDecoder.decode(parameterWords, numECCodewords);
  } catch (ReedSolomonException ignored) {
    throw NotFoundException.getNotFoundInstance();
  }
  // Toss the error correction.  Just return the data as an integer
  int result = 0;
  for (int i = 0; i < numDataCodewords; i++) {
    result = (result << 4) + parameterWords[i];
  }
  return result;
}
 

/**
 * Corrects the parameter bits using Reed-Solomon algorithm.
 *
 * @param parameterData parameter bits
 * @param compact true if this is a compact Aztec code
 * @throws NotFoundException if the array contains too many errors
 */
private static int getCorrectedParameterData(long parameterData, boolean compact) throws NotFoundException {
  int numCodewords;
  int numDataCodewords;

  if (compact) {
    numCodewords = 7;
    numDataCodewords = 2;
  } else {
    numCodewords = 10;
    numDataCodewords = 4;
  }

  int numECCodewords = numCodewords - numDataCodewords;
  int[] parameterWords = new int[numCodewords];
  for (int i = numCodewords - 1; i >= 0; --i) {
    parameterWords[i] = (int) parameterData & 0xF;
    parameterData >>= 4;
  }
  try {
    ReedSolomonDecoder rsDecoder = new ReedSolomonDecoder(GenericGF.AZTEC_PARAM);
    rsDecoder.decode(parameterWords, numECCodewords);
  } catch (ReedSolomonException ignored) {
    throw NotFoundException.getNotFoundInstance();
  }
  // Toss the error correction.  Just return the data as an integer
  int result = 0;
  for (int i = 0; i < numDataCodewords; i++) {
    result = (result << 4) + parameterWords[i];
  }
  return result;
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

/** Called when the samples have been updated. */
private static final void onGaydecki(final ReedSolomonDecoder pReedSolomonDecoder, final double[] pSamples, final double[] pConfidences, final int pSubsamples, final ChirpFactory.IListener pChirpListener) {
    // Calculate the Number of Symbols.
    final int    lSymbols      = (pSamples.length / pSubsamples);
    // Declare the String.
          String lAccumulation = "";
    // Iterate the Samples whilst we're building up the string.
    for(int i = 0; i < lSymbols && (lAccumulation.length() != MainActivity.FACTORY_CHIRP.getEncodedLength()); i++) {
        // Fetch the Offset for the next Symbol.
        final int lOffset = (i * pSubsamples);
        // Detect the Chirp.
        final ChirpFactory.Result lResult = ChirpFactory.DETECTOR_CHIRP_MEAN.getSymbol(MainActivity.FACTORY_CHIRP, pSamples, pConfidences, lOffset, pSubsamples);
        // Is the Result valid?
        if(lResult.isValid()) {
            // Buffer the Result's data into the Accumulation.
            lAccumulation += lResult.getCharacter();
        }
    }
    // Is the accumulated data long enough?
    if(lAccumulation.length() == MainActivity.FACTORY_CHIRP.getEncodedLength()) {
        // Declare the Packetized Representation.
        final int[] lPacketized = new int[MainActivity.FACTORY_CHIRP.getRange().getFrameLength()];
        // Buffer the Header/Payload.
        for(int i = 0; i < MainActivity.FACTORY_CHIRP.getIdentifier().length() + MainActivity.FACTORY_CHIRP.getPayloadLength(); i++) {
            // Update the Packetized with the corresponding index value.
            lPacketized[i] = MainActivity.FACTORY_CHIRP.getRange().getCharacters().indexOf(lAccumulation.charAt(i));
        }
        // Iterate the Error Symbols.
        for(int i = 0; i < MainActivity.FACTORY_CHIRP.getErrorLength(); i++) {
            // Update the Packetized with the corresponding index value.
            lPacketized[MainActivity.FACTORY_CHIRP.getRange().getFrameLength() - MainActivity.FACTORY_CHIRP.getErrorLength() + i] = MainActivity.FACTORY_CHIRP.getRange().getCharacters().indexOf(lAccumulation.charAt(MainActivity.FACTORY_CHIRP.getIdentifier().length() + MainActivity.FACTORY_CHIRP.getPayloadLength() + i));
        }
        // Attempt to Reed/Solomon Decode.
        try {
            // Decode the Sample.
            pReedSolomonDecoder.decode(lPacketized, MainActivity.FACTORY_CHIRP.getErrorLength());
            // Declare the search metric.
            boolean lIsValid = true;
            // Iterate the Identifier characters.
            for(int i = 0; i < MainActivity.FACTORY_CHIRP.getIdentifier().length(); i++) {
                // Update the search metric.
                lIsValid &= MainActivity.FACTORY_CHIRP.getIdentifier().charAt(i) == (MainActivity.FACTORY_CHIRP.getRange().getCharacters().charAt(lPacketized[i]));
            }
            // Is the message directed to us?
            if(lIsValid) {
                // Fetch the Message data.
                String lMessage = "";
                // Iterate the Packet.
                for(int i = MainActivity.FACTORY_CHIRP.getIdentifier().length(); i < MainActivity.FACTORY_CHIRP.getIdentifier().length() + MainActivity.FACTORY_CHIRP.getPayloadLength(); i++) {
                    // Accumulate the Message.
                    lMessage += MainActivity.FACTORY_CHIRP.getRange().getCharacters().charAt(lPacketized[i]);
                }
                // Call the callback.
                pChirpListener.onChirp(lMessage);
            }
        }
        catch(final ReedSolomonException pReedSolomonException) { /* Do nothing; we're transmitting across a very lossy channel! */ }
    }
}
 

private final ReedSolomonDecoder getReedSolomonDecoder() {
    return this.mReedSolomonDecoder;
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.DATA_MATRIX_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.MAXICODE_FIELD_64);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.DATA_MATRIX_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.MAXICODE_FIELD_64);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.DATA_MATRIX_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.MAXICODE_FIELD_64);
}
 

public EncoderDecoder(){
	decoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
	encoder = new ReedSolomonEncoder(GenericGF.QR_CODE_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.DATA_MATRIX_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.MAXICODE_FIELD_64);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.DATA_MATRIX_FIELD_256);
}
 

public Decoder() {
  rsDecoder = new ReedSolomonDecoder(GenericGF.MAXICODE_FIELD_64);
}
 

public Decoder()
{
    a = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}
 

private static void a(boolean aflag[], boolean flag)
{
    byte byte0;
    byte byte1;
    int i;
    int ai[];
    if (flag)
    {
        byte0 = 7;
        byte1 = 2;
    } else
    {
        byte0 = 10;
        byte1 = 4;
    }
    i = byte0 - byte1;
    ai = new int[byte0];
    for (int j = 0; j < byte0; j++)
    {
        int k1 = 1;
        int l1 = 1;
        for (; k1 <= 4; k1++)
        {
            if (aflag[(4 + 4 * j) - k1])
            {
                ai[j] = l1 + ai[j];
            }
            l1 <<= 1;
        }

    }

    int k;
    try
    {
        (new ReedSolomonDecoder(GenericGF.AZTEC_PARAM)).decode(ai, i);
    }
    catch (ReedSolomonException reedsolomonexception)
    {
        throw NotFoundException.getNotFoundInstance();
    }
    for (k = 0; k < byte1; k++)
    {
        int l = 1;
        int i1 = 1;
        while (l <= 4) 
        {
            int j1 = (4 + k * 4) - l;
            boolean flag1;
            if ((i1 & ai[k]) == i1)
            {
                flag1 = true;
            } else
            {
                flag1 = false;
            }
            aflag[j1] = flag1;
            i1 <<= 1;
            l++;
        }
    }

}
 

public Decoder()
{
    a = new ReedSolomonDecoder(GenericGF.DATA_MATRIX_FIELD_256);
}
 

public Decoder()
{
    d = new ReedSolomonDecoder(GenericGF.MAXICODE_FIELD_64);
}
 

public Decoder() {
	rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
}