| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Building blockcipher from small-block tweakable blockcipher
|
Minematsu, Kazuhiko
|
|
2013
|
74 |
3 |
p. 645-663
|
artikel
|
| 2 |
Classification of self-dual codes of length 50 with an automorphism of odd prime order
|
Yankov, Nikolay
|
|
2013
|
74 |
3 |
p. 571-579
|
artikel
|
| 3 |
Computing in degree $$2^k$$2k-extensions of finite fields of odd characteristic
|
Doliskani, Javad
|
|
2013
|
74 |
3 |
p. 559-569
|
artikel
|
| 4 |
Highly nonlinear functions
|
Schmidt, Kai-Uwe
|
|
2013
|
74 |
3 |
p. 665-672
|
artikel
|
| 5 |
New extremal binary self-dual codes of length 64 from $$R_3$$R3-lifts of the extended binary Hamming code
|
Karadeniz, Suat
|
|
2013
|
74 |
3 |
p. 673-680
|
artikel
|
| 6 |
On generator matrices and parity check matrices of generalized integer codes
|
Matsui, Hajime
|
|
2013
|
74 |
3 |
p. 681-701
|
artikel
|
| 7 |
On graphs and codes preserved by edge local complementation
|
Danielsen, Lars Eirik
|
|
2013
|
74 |
3 |
p. 601-621
|
artikel
|
| 8 |
On the bounds and achievability about the ODPC of $$\mathcal{GRM }(2,m)^*$$GRM(2,m)∗ over prime fields for increasing message length
|
Liu, Xiaogang
|
|
2013
|
74 |
3 |
p. 533-557
|
artikel
|
| 9 |
On the linear complexity of Legendre–Sidelnikov sequences
|
Su, Ming
|
|
2013
|
74 |
3 |
p. 703-717
|
artikel
|
| 10 |
Optimal assignment schemes for general access structures based on linear programming
|
Li, Qiang
|
|
2013
|
74 |
3 |
p. 623-644
|
artikel
|
| 11 |
Paley type sets from cyclotomic classes and Arasu–Dillon–Player difference sets
|
Chen, Yu Qing
|
|
2013
|
74 |
3 |
p. 581-600
|
artikel
|
| 12 |
Quasi-abelian codes
|
Jitman, Somphong
|
|
2013
|
74 |
3 |
p. 511-531
|
artikel
|
| 13 |
Secret sharing on the d-dimensional cube
|
Csirmaz, László
|
|
2013
|
74 |
3 |
p. 719-729
|
artikel
|
Tijdschrift beschrijving