Fatten 发表于 2025-3-26 21:52:30

http://reply.papertrans.cn/23/2290/228913/228913_31.png

spondylosis 发表于 2025-3-27 04:08:02

Aleš Jaklič,Aleš Leonardis,Franc Solina describe the construction of an instance of our system – which is a modified Polly Cracker scheme – starting from such a 3-SAT formula. Then we discuss security issues: this is achieved on the one hand by exploring best methods to date for solving this particular problem, and on the other hand by s

清唱剧 发表于 2025-3-27 05:22:59

Aleš Jaklič,Aleš Leonardis,Franc Solinaposed (γ,ρ) regular LDPC ensemble has rate . girth ≥2., and exists for all γ≥2. The codes are a subset of Gallager’s random ensemble, but contains a good combination ofstructure and (pseudo)randomness. In particular, the simple case of γ=2 results in a class of codes that are high-rate, systematic,

BROW 发表于 2025-3-27 12:57:07

http://reply.papertrans.cn/23/2290/228913/228913_34.png

施魔法 发表于 2025-3-27 15:16:25

http://reply.papertrans.cn/23/2290/228913/228913_35.png

高调 发表于 2025-3-27 18:51:25

Segmentation Using Two-Step Cluster Analysisviewed as the problem of constructing good linear codes in metric spaces that are more general than Hamming spaces. In this paper we report on the fascinating connections between digital nets and linear codes. In particular, we describe the duality theory for digital nets, the asymptotics of digital

Etching 发表于 2025-3-27 23:53:16

http://reply.papertrans.cn/23/2290/228913/228913_37.png

notification 发表于 2025-3-28 03:35:57

Progress in Computer Science and Applied Logichttp://image.papertrans.cn/c/image/228913.jpg

天赋 发表于 2025-3-28 09:02:24

Coding, Cryptography and Combinatorics978-3-0348-7865-4Series ISSN 2297-0576 Series E-ISSN 2297-0584

Bumble 发表于 2025-3-28 13:16:55

https://doi.org/10.1007/978-3-642-88157-2 elliptic modular curves, Shimura curves, or Drinfeld modular curves by appropriate reduction. In this paper we review the recursive asymptotically optimal towers constructed so far, discuss the reasons behind Elkies’ conjecture, present numerical evidence of this conjecture, and sketch Elkies’ proof of modularity of the new families.
页: 1 2 3 [4] 5 6 7
查看完整版本: Titlebook: Coding, Cryptography and Combinatorics; Keqin Feng,Harald Niederreiter,Chaoping Xing Conference proceedings 2004 Springer Basel AG 2004 DE