Titlebook: Coding, Cryptography and Combinatorics; Keqin Feng,Harald Niederreiter,Chaoping Xing Conference proceedings 2004 Springer Basel AG 2004 DE

patch-test

書目名稱Coding, Cryptography and Combinatorics影響因子(影響力)




書目名稱Coding, Cryptography and Combinatorics影響因子(影響力)學(xué)科排名




書目名稱Coding, Cryptography and Combinatorics網(wǎng)絡(luò)公開度




書目名稱Coding, Cryptography and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Coding, Cryptography and Combinatorics被引頻次




書目名稱Coding, Cryptography and Combinatorics被引頻次學(xué)科排名




書目名稱Coding, Cryptography and Combinatorics年度引用




書目名稱Coding, Cryptography and Combinatorics年度引用學(xué)科排名




書目名稱Coding, Cryptography and Combinatorics讀者反饋




書目名稱Coding, Cryptography and Combinatorics讀者反饋學(xué)科排名

disrupt

Modularity of Asymptotically Optimal Towers of Function Fields 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’ proo

柔軟

A New Correlation Attack on LFSR Sequences with High Error Tolerance) be . bits of observed sequence such that .(.. = ..)=1/2 + δ where .. This paper presents a new efficient correlation attack on stream ciphers, which is equivalent to solve the problem of recovering the LFSR’s initial state (. = (.., ..,…,..)from the observed output sequence z. We consider the prob

EXUDE

Lumbar-Stenosis

dura-mater

The Capacity Region of Broadcast Networks with Two Receiversf the minimal cut that separates the source and the sink. Recently, it has been shown that if the intermediate nodes in the network are allowed to code the information that they receive, then the source . can multicast common information to several sinks at a rate that does not exceed the min-cut be

dura-mater

On the Propagation Criterion of Boolean Functions the propagation criterion of high degree were given by Preneel et al., but their algebraic degree is too small for a cryptograhic use. Then designing Boolean functions of high algebraic degree and high degree of propagation has been the goal of several papers. In this paper, we investigate the work

慢跑

A Polly Cracker System Based on Satisfiability 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

SLUMP

Combinatorially Designed LDPC Codes Using Zech Logarithms and Congruential Sequencesposed (γ,ρ) 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,

火光在搖曳