The secrecy capacity of the arbitrarily varying wiretap channel under list decoding.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 11, doi. 10.3934/amc.2019002
- By:
- Publication type:
- Article
Works matching IS 19305346 AND DT 2019 AND VI 13 AND IP 1
Results: 12
1
2
Optimal information ratio of secret sharing schemes on Dutch windmill graphs.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 89, doi. 10.3934/amc.2019005
- By:
- Publication type:
- Article
3
Double circulant self-dual and LCD codes over Galois rings.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 171, doi. 10.3934/amc.2019011
- By:
- Publication type:
- Article
4
Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 1, doi. 10.3934/amc.2019001
- By:
- Publication type:
- Article
5
Some two-weight and three-weight linear codes.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 195, doi. 10.3934/amc.2019013
- By:
- Publication type:
- Article
6
Wave-shaped round functions and primitive groups.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 67, doi. 10.3934/amc.2019004
- By:
- Publication type:
- Article
7
The weight distribution of a class of p-ary cyclic codes and their applications.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 137, doi. 10.3934/amc.2019008
- By:
- Publication type:
- Article
8
New 2-designs over finite fields from derived and residual designs.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 165, doi. 10.3934/amc.2019010
- By:
- Publication type:
- Article
9
Maximum weight spectrum codes.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 101, doi. 10.3934/amc.2019006
- By:
- Publication type:
- Article
10
Further improvement of factoring N = p<sub>r</sub>q<sub>s</sub> with partial known bits.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 121, doi. 10.3934/amc.2019007
- By:
- Publication type:
- Article
11
On the security of the WOTS-PRF signature scheme.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 185, doi. 10.3934/amc.2019012
- By:
- Publication type:
- Article
12
Connecting Legendre with Kummer and Edwards.
- Published in:
- Advances in Mathematics of Communications, 2019, v. 13, n. 1, p. 41, doi. 10.3934/amc.2019003
- By:
- Publication type:
- Article