| /external/fec/ |
| init_rs.h | 61 /* field generator polynomial is not primitive! */
69 /* Form RS code generator polynomial from its roots */
|
| decode_rs.c | 77 /* Init lambda to be the erasure locator polynomial */
89 /* Test code that verifies the erasure locator polynomial just constructed
92 /* find roots of the erasure location polynomial */
129 * locator polynomial
179 /* Find roots of the error+erasure locator polynomial by Chien search */
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| ECCurve.java | 889 * x<sup>k</sup> + 1</code> represents the reduction polynomial
893 * represents the reduction polynomial <code>f(z)</code>.<br>
901 * represents the reduction polynomial <code>f(z)</code>.<br>
909 * represents the reduction polynomial <code>f(z)</code>.<br>
919 * Constructor for Trinomial Polynomial Basis (TPB).
924 * polynomial <code>f(z)</code>.
942 * Constructor for Trinomial Polynomial Basis (TPB).
947 * polynomial <code>f(z)</code>.
970 * Constructor for Pentanomial Polynomial Basis (PPB).
975 * represents the reduction polynomial <code>f(z)</code>
[all...] |
| ECFieldElement.java | 496 * <code>F<sub>2<sup>m</sup></sub></code> in polynomial basis (PB)
497 * representation. Both trinomial (TPB) and pentanomial (PPB) polynomial
544 * represents the reduction polynomial <code>f(z)</code>.
547 * represents the reduction polynomial <code>f(z)</code>.
550 * represents the reduction polynomial <code>f(z)</code>.
597 * polynomial <code>f(z)</code>.
813 * @return the degree <code>m</code> of the reduction polynomial
823 * x<sup>k</sup> + 1</code> represents the reduction polynomial
827 * represents the reduction polynomial <code>f(z)</code>.<br>
838 * represents the reduction polynomial <code>f(z)</code>.<br
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| crc32c_defs.h | 2 * This is the CRC32c polynomial, as outlined by Castagnoli.
|
| /external/fio/crc/ |
| crc32c-intel.c | 14 * CRC32C polynomial:0x1EDC6F41(BE)/0x82F63B78(LE)
|
| /external/jsilver/src/com/google/clearsilver/jsilver/functions/string/ |
| CrcFunction.java | 38 // This function produces a 'standard' CRC-32 (IV -1, reflected polynomial,
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/math/tools/ |
| user.hpp | 29 // The maximum order of polynomial that will be evaluated
|
| /system/core/libsparse/ |
| sparse_format.h | 31 /* as 0. Standard 802.3 polynomial, use a Public Domain */
|
| sparse_crc32.c | 7 * First, the polynomial itself and its table of feedback terms. The
8 * polynomial is
39 * polynomial $edb88320
|
| /system/media/audio_utils/ |
| limiter.c | 52 // polynomial spline
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| k_log.h | 23 * term of the polynomial are done by the caller for increased accuracy
36 * a polynomial of degree 14 to approximate R The maximum error
37 * of this polynomial approximation is bounded by 2**-58.45. In
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/jni/ |
| jni_stochastic_linear_ranker.h | 53 /* Three differnt kernels are supported: Linear "LINEAR", Polynomial "POLY", and RBF "RBF"
57 /* Kernel param is kernel-specific. In case of polynomial kernel, it is the degree of the
58 polynomial. In case of RBF kernel, it implies the sigma parameter. In case of linear
|
| /ndk/sources/android/support/src/msun/ |
| k_log.h | 23 * term of the polynomial are done by the caller for increased accuracy
36 * a polynomial of degree 14 to approximate R The maximum error
37 * of this polynomial approximation is bounded by 2**-58.45. In
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/docs/source/ |
| crcmod.rst | 32 :param poly: The generator polynomial to use in calculating the CRC. The value
34 are the coefficients of the polynomial. The only polynomials allowed are
117 :param poly: The generator polynomial to use in calculating the CRC. The value
119 are the coefficients of the polynomial. The only polynomials allowed are
140 The size of the resulting digest in bytes. This depends on the width of the CRC polynomial.
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/python2/crcmod/ |
| test.py | 44 # This polynomial was chosen because it is the product of two irreducible
51 # This is the standard CCITT polynomial.
58 # This is the standard AUTODIN-II polynomial which appears to be used in a
66 # polynomial from a list of the bits that need to be turned on.
90 # implementation using polynomial division.
96 if p < 0: raise ValueError('invalid polynomial')
147 if v == 0: raise ZeroDivisionError('polynomial division by zero')
190 '''return the degree of the polynomial'''
204 # The following functions compute the CRC using direct polynomial division.
342 polynomial-based implementation.""
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/python3/crcmod/ |
| test.py | 39 # This polynomial was chosen because it is the product of two irreducible
46 # This is the standard CCITT polynomial.
53 # This is the standard AUTODIN-II polynomial which appears to be used in a
61 # polynomial from a list of the bits that need to be turned on.
85 # implementation using polynomial division.
91 if p < 0: raise ValueError('invalid polynomial')
142 if v == 0: raise ZeroDivisionError('polynomial division by zero')
185 '''return the degree of the polynomial'''
199 # The following functions compute the CRC using direct polynomial division.
331 polynomial-based implementation.""
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod_osx/crcmod/ |
| test.py | 44 # This polynomial was chosen because it is the product of two irreducible
51 # This is the standard CCITT polynomial.
58 # This is the standard AUTODIN-II polynomial which appears to be used in a
66 # polynomial from a list of the bits that need to be turned on.
90 # implementation using polynomial division.
96 if p < 0: raise ValueError('invalid polynomial')
147 if v == 0: raise ZeroDivisionError('polynomial division by zero')
190 '''return the degree of the polynomial'''
204 # The following functions compute the CRC using direct polynomial division.
342 polynomial-based implementation.""
[all...] |
| /external/opencv3/modules/calib3d/src/ |
| triangulate.cpp | 190 cv::Ptr<CvMat> polynomial; local
247 polynomial.reset(cvCreateMat(1,7,CV_64FC1));
330 // Form the polynomial g(t) = k6*t? + k5*t? + k4*t? + k3*t³ + k2*t² + k1*t + k0
332 cvSetReal2D(polynomial,0,6,( +b*c*c*f1*f1*f1*f1*a-a*a*d*f1*f1*f1*f1*c ));
333 cvSetReal2D(polynomial,0,5,( +f2*f2*f2*f2*c*c*c*c+2*a*a*f2*f2*c*c-a*a*d*d*f1*f1*f1*f1+b*b*c*c*f1*f1*f1*f1+a*a*a*a ));
334 cvSetReal2D(polynomial,0,4,( +4*a*a*a*b+2*b*c*c*f1*f1*a+4*f2*f2*f2*f2*c*c*c*d+4*a*b*f2*f2*c*c+4*a*a*f2*f2*c*d-2*a*a*d*f1*f1*c-a*d*d*f1*f1*f1*f1*b+b*b*c*f1*f1*f1*f1*d ));
335 cvSetReal2D(polynomial,0,3,( +6*a*a*b*b+6*f2*f2*f2*f2*c*c*d*d+2*b*b*f2*f2*c*c+2*a*a*f2*f2*d*d-2*a*a*d*d*f1*f1+2*b*b*c*c*f1*f1+8*a*b*f2*f2*c*d ));
336 cvSetReal2D(polynomial,0,2,( +4*a*b*b*b+4*b*b*f2*f2*c*d+4*f2*f2*f2*f2*c*d*d*d-a*a*d*c+b*c*c*a+4*a*b*f2*f2*d*d-2*a*d*d*f1*f1*b+2*b*b*c*f1*f1*d ));
337 cvSetReal2D(polynomial,0,1,( +f2*f2*f2*f2*d*d*d*d+b*b*b*b+2*b*b*f2*f2*d*d-a*a*d*d+b*b*c*c ));
338 cvSetReal2D(polynomial,0,0,( -a*d*d*b+b*b*c*d ))
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/python2/src/ |
| _crcfunext.c | 74 // polynomial.
115 // polynomial.
155 // polynomial.
196 // polynomial.
236 // polynomial.
277 // polynomial.
318 // polynomial.
359 // polynomial.
399 // polynomial.
440 // polynomial
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/python3/src/ |
| _crcfunext.c | 92 // polynomial.
141 // polynomial.
189 // polynomial.
238 // polynomial.
286 // polynomial.
335 // polynomial.
384 // polynomial.
433 // polynomial.
481 // polynomial.
530 // polynomial
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/gslib/ |
| hashing_helper.py | 82 # Table storing polynomial values of x^(2^k) mod CASTAGNOLI_POLY for all k < 31,
91 # Castagnoli polynomial and its degree.
121 p: The first polynomial.
122 q: The second polynomial.
141 """Given crc representing polynomial P(x), compute P(x)*x^num_bits.
144 crc: crc respresenting polynomial P(x).
|
| /external/dng_sdk/source/ |
| dng_misc_opcodes.h | 199 /// \brief An opcode to apply a 1D function (represented as a polynomial) to an
224 /// Create a MapPolynomial opcode with the specified area, polynomial
225 /// degree, and polynomial coefficients. The function that will be
|
| /external/vboot_reference/firmware/lib/cgptlib/ |
| crc32.c | 7 /* First, the polynomial itself and its table of feedback terms. The */
8 /* polynomial is */
39 /* polynomial $edb88320 */
|
| /bionic/libm/upstream-freebsd/lib/msun/ld128/ |
| k_cosl.c | 28 * simple methods give a minimax polynomial with coefficient for x^2
|
