情爱
发表于 2025-3-23 20:08:35
Auflösung linearer GleichungssystemeFollowing R. Pellikaan who gave, in 1989, an algorithm which decodes geometric codes up to . errors where d* is the designed distance of the code, we describe an effective decoding procedure for some geometric codes on the Klein quartic.
apiary
发表于 2025-3-23 22:57:24
http://reply.papertrans.cn/31/3007/300622/300622_14.png
工作
发表于 2025-3-24 06:17:31
A direct proof for the automorphism group of reed solomon codes,We introduce a special basis for the description of the primitive extended cyclic codes, considered as subspaces of the modular algebra A=GF(p.). Using properties of this basis, we determine the automorphism group of some extended cyclic codes, among the extended Reed Solomon codes.
反对
发表于 2025-3-24 09:44:06
Covering radius of RM(1,9) in RM(3,9),We give new properties about Fourier coefficients and we prove that the distance of the first order Reed-Muller code of length 512 to any cubic is at most 240.
FILTH
发表于 2025-3-24 12:29:13
http://reply.papertrans.cn/31/3007/300622/300622_17.png
incredulity
发表于 2025-3-24 17:26:38
http://reply.papertrans.cn/31/3007/300622/300622_18.png
Inflammation
发表于 2025-3-24 20:15:57
Decoding of codes on hyperelliptic curves,In 1989, R. Pellikaan gave an algorithm which decodes geometric codes up to .-errors, where .* is the designed distance of the code. Unfortunately this algorithm is not completely effective. I present facts about the jacobian of a hyperelliptic curve which permits in some cases to perform the algorithm.
急急忙忙
发表于 2025-3-24 23:41:46
Decoding of codes on the klein quartic,Following R. Pellikaan who gave, in 1989, an algorithm which decodes geometric codes up to . errors where d* is the designed distance of the code, we describe an effective decoding procedure for some geometric codes on the Klein quartic.
漂白
发表于 2025-3-25 07:10:30
Asymptotically good families of geometric goppa codes and the gilbert-varshamov bound,This note presents a generalization of the fact that most of the classical Goppa codes lie arbitrarily close to the Gilbert-Varshamov bound (cf. ).
Complement
发表于 2025-3-25 11:16:13
http://reply.papertrans.cn/31/3007/300622/300622_22.png