表示向下 发表于 2025-3-30 08:25:11
http://reply.papertrans.cn/25/2406/240570/240570_51.pngpalette 发表于 2025-3-30 15:57:51
Greedy Recommending Is Not Always Optimal,Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.Allege 发表于 2025-3-30 17:55:41
http://reply.papertrans.cn/25/2406/240570/240570_53.png解冻 发表于 2025-3-30 21:54:02
On the Classification of Self-dual ,-CodesA classification of self-dual .-codes of modest lengths is known for small .. For . = 4,6,8,9 and 10, the classification of self-dual .-codes is extended to lengths 19,12,12,12 and 10, respectively, by considering .-frames of unimodular lattices.前奏曲 发表于 2025-3-31 03:52:23
On Linear Codes from Maximal CurvesSome linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.BLOT 发表于 2025-3-31 05:36:36
http://reply.papertrans.cn/25/2406/240570/240570_56.png神经 发表于 2025-3-31 09:30:06
http://reply.papertrans.cn/25/2406/240570/240570_57.png制定法律 发表于 2025-3-31 14:24:21
http://reply.papertrans.cn/25/2406/240570/240570_58.pngneutrophils 发表于 2025-3-31 19:53:57
http://reply.papertrans.cn/25/2406/240570/240570_59.png共栖 发表于 2025-4-1 01:34:25
Eric M. Anderman,Tim Urdan,Robert Roeser of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more codewords. Algorithms for encoding and decoding are also briefly described.