浮雕
发表于 2025-3-30 09:28:41
http://reply.papertrans.cn/23/2289/228890/228890_51.png
gregarious
发表于 2025-3-30 15:11:49
http://reply.papertrans.cn/23/2289/228890/228890_52.png
synovial-joint
发表于 2025-3-30 16:57:43
http://reply.papertrans.cn/23/2289/228890/228890_53.png
Detain
发表于 2025-3-30 21:14:32
Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints, 3.2]. Among the codes that we construct almost all have parameters as good as the best known codes according to [.] and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound [., .] from Gröbner basis theory and for this purpose w
使纠缠
发表于 2025-3-31 03:49:48
http://reply.papertrans.cn/23/2289/228890/228890_55.png
替代品
发表于 2025-3-31 07:55:07
http://reply.papertrans.cn/23/2289/228890/228890_56.png
Mhc-Molecule
发表于 2025-3-31 10:25:42
http://reply.papertrans.cn/23/2289/228890/228890_57.png
Perigee
发表于 2025-3-31 13:31:22
http://reply.papertrans.cn/23/2289/228890/228890_58.png
制定
发表于 2025-3-31 21:26:12
Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes,t is how one can express the relative generalized Hamming weights of a pair of codes in terms of intersection properties between the smallest of these codes and subcodes of the largest code. The other result tells how one can find the extended weight polynomials, expressing the number of codewords o
Nostalgia
发表于 2025-4-1 01:27:31
http://reply.papertrans.cn/23/2289/228890/228890_60.png