Function report |
Source Code:lib\bch.c |
Create Date:2022-07-28 06:59:48 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:mpute root r of a degree 1 polynomial over GF(2^m) (returned as log(1/r))
Proto:static int find_poly_deg1_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots)
Type:int
Parameter:
Type | Parameter | Name |
---|---|---|
struct bch_control * | bch | |
struct gf_poly * | poly | |
unsigned int * | roots |
558 | n = 0 |
560 | If polynomial terms [0] Then roots[n++] = shorter and faster modulo function, only works when v < 2N. |
564 | Return n |
Name | Describe |
---|---|
find_poly_roots | d roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details |
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 |