Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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 activityDownload SCCTChinese

Name:mpute polynomial Euclidean division remainder in GF(2^m)[X]

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

Type:void

Parameter:

TypeParameterName
struct bch_control *bch
struct gf_poly *a
const struct gf_poly *b
int *rep
726  c = polynomial terms
727  d = polynomial degree
729  If polynomial degree < d Then Return
733  If Not rep Then
734  rep = cache
735  ld monic, log-based representation of a polynomial
738  When j >= d cycle
739  If c[j] Then
740  la = a_log(bch, c[j])
741  p = j - d
742  When i < d cycle
750  polynomial degree = d - 1
751  When Not c[polynomial degree ] && polynomial degree cycle
752  polynomial degree --
Caller
NameDescribe
gf_poly_divmpute polynomial Euclidean division quotient in GF(2^m)[X]
gf_poly_gcdmpute polynomial GCD (Greatest Common Divisor) 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