Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:actor a polynomial using Berlekamp Trace algorithm (BTA)

Proto:static void factor_polynomial(struct bch_control *bch, int k, struct gf_poly *f, struct gf_poly **g, struct gf_poly **h)

Type:void

Parameter:

TypeParameterName
struct bch_control *bch
intk
struct gf_poly *f
struct gf_poly **g
struct gf_poly **h
851  f2 = poly_2t[0]
852  q = poly_2t[1]
853  tk = poly_2t[2]
854  z = poly_2t[3]
857  dbg("factoring %s...\n", gf_poly_str(f))
859  g = f
860  * h = NULL
863  Given a polynomial f and an integer k, compute Tr(a^kX) mod f* This is used in Berlekamp Trace algorithm for splitting polynomials
865  If polynomial degree > 0 Then
867  gf_poly_copy(f2, f)
868  gcd = mpute polynomial GCD (Greatest Common Divisor) in GF(2^m)[X]
869  If polynomial degree < polynomial degree Then
871  mpute polynomial Euclidean division quotient in GF(2^m)[X]
873  h = poly
874  gf_poly_copy( * g, gcd)
875  gf_poly_copy( * h, q)
Caller
NameDescribe
find_poly_rootsd roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details