public QRPolynomial Mod(QRPolynomial e)
{
bool flag = Convert.ToInt64(this.GetLength()) - Convert.ToInt64(e.GetLength()) < 0L;
QRPolynomial result;
if (flag)
{
result = this;
}
else
{
int num = QRMath.GLog(this.Get(0)) - QRMath.GLog(e.Get(0));
DataCache num2 = new DataCache(this.GetLength());
for (int index = 0; index < this.GetLength(); index++)
{
num2[index] = this.Get(index);
}
for (int index2 = 0; index2 < e.GetLength(); index2++)
{
List <int> list;
int index3;
(list = num2)[index3 = index2] = (list[index3] ^ QRMath.GExp(QRMath.GLog(e.Get(index2)) + num));
}
result = new QRPolynomial(num2, 0).Mod(e);
}
return(result);
}
public QRPolynomial Multiply(QRPolynomial e)
{
DataCache num = new DataCache(this.GetLength() + e.GetLength() - 1);
for (int index = 0; index < this.GetLength(); index++)
{
for (int index2 = 0; index2 < e.GetLength(); index2++)
{
List <int> list;
int index3;
(list = num)[index3 = index + index2] = (list[index3] ^ QRMath.GExp(QRMath.GLog(this.Get(index)) + QRMath.GLog(e.Get(index2))));
}
}
return(new QRPolynomial(num, 0));
}
internal static QRPolynomial GetErrorCorrectPolynomial(int errorCorrectLength)
{
QRPolynomial polynomial = new QRPolynomial(new DataCache
{
1
}, 0);
for (int i = 0; i < errorCorrectLength; i++)
{
polynomial = polynomial.Multiply(new QRPolynomial(new DataCache
{
1,
QRMath.GExp(i)
}, 0));
}
return(polynomial);
}