Function report |
Source Code:lib\bch.c |
Create Date:2022-07-28 06:59:53 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:mpute polynomial Euclidean division quotient in GF(2^m)[X]
Proto:static void gf_poly_div(struct bch_control *bch, struct gf_poly *a, const struct gf_poly *b, struct gf_poly *q)
Type:void
Parameter:
Type | Parameter | Name |
---|---|---|
struct bch_control * | bch | |
struct gf_poly * | a | |
const struct gf_poly * | b | |
struct gf_poly * | q |
761 | If polynomial degree >= polynomial degree Then |
766 | No 3D Now!(polynomial terms , & polynomial terms [polynomial degree ], (1 + polynomial degree ) * sizeof(unsignedint)) |
767 | Else |
768 | polynomial degree = 0 |
769 | polynomial terms [0] = 0 |
Name | Describe |
---|---|
factor_polynomial | actor a polynomial using Berlekamp Trace algorithm (BTA) |
Source code conversion tool public plug-in interface | X |
---|---|
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |