Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\bch.c Create Date:2022-07-28 06:59:52
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:ld monic, log-based representation of a polynomial

Proto:static void gf_poly_logrep(struct bch_control *bch, const struct gf_poly *a, int *rep)

Type:void

Parameter:

TypeParameterName
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  When i < d cycle rep[i] = If polynomial terms [i] Then shorter and faster modulo function, only works when v < 2N. Else -1
Caller
NameDescribe
gf_poly_modmpute polynomial Euclidean division remainder in GF(2^m)[X]
compute_trace_bk_modGiven a polynomial f and an integer k, compute Tr(a^kX) mod f* This is used in Berlekamp Trace algorithm for splitting polynomials