函数逻辑报告 |
Source Code:lib\bch.c |
Create Date:2022-07-27 07:57:17 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:ld monic, log-based representation of a polynomial
函数原型:static void gf_poly_logrep(struct bch_control *bch, const struct gf_poly *a, int *rep)
返回类型:void
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct bch_control * | bch | |
| const struct gf_poly * | a | |
| int * | rep |
| 712 | d等于polynomial degree , l等于GF_N(bch)减a_log(bch, polynomial terms [polynomial degree ]) |
| 715 | 以i小于d循环rep[i]等于如果polynomial terms [i]则shorter and faster modulo function, only works when v < 2N.否则负1 |
| 名称 | 描述 |
|---|---|
| gf_poly_mod | mpute polynomial Euclidean division remainder in GF(2^m)[X] |
| compute_trace_bk_mod | Given a polynomial f and an integer k, compute Tr(a^kX) mod f* This is used in Berlekamp Trace algorithm for splitting polynomials |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |