| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A nonexistence certificate for projective planes of order ten with weight 15 codewords
|
Bright, Curtis
|
|
|
31 |
3-4 |
p. 195-213
|
artikel
|
| 2 |
A trigonometric approach for Dickson polynomials over fields of characteristic two
|
Lima, Juliano B.
|
|
|
31 |
3-4 |
p. 253-270
|
artikel
|
| 3 |
Boomerang uniformity of normalized permutation polynomials of low degree
|
Wang, Yan-Ping
|
|
|
31 |
3-4 |
p. 307-322
|
artikel
|
| 4 |
Hamming distance of repeated-root constacyclic codes of length 2ps over Fpm+uFpm
|
Dinh, Hai Q.
|
|
|
31 |
3-4 |
p. 291-305
|
artikel
|
| 5 |
HELP: a sparse error locator polynomial for BCH codes
|
Ceria, Michela
|
|
|
31 |
3-4 |
p. 215-233
|
artikel
|
| 6 |
Optimal RS-like LRC codes of arbitrary length
|
Rajput, Charul
|
|
|
31 |
3-4 |
p. 271-289
|
artikel
|
| 7 |
Skew constacyclic codes over a non-chain ring Fq[u,v]/⟨f(u),g(v),uv-vu⟩
|
Bhardwaj, Swati
|
|
|
31 |
3-4 |
p. 173-194
|
artikel
|
| 8 |
Special Issue: “Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography” ACA 2019, Montreal, Canada, July 16–20, 2019
|
Guenda, Kenza
|
|
|
31 |
3-4 |
p. 171-172
|
artikel
|
| 9 |
Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
|
Barkee, Boo
|
|
|
31 |
3-4 |
p. 235-252
|
artikel
|
Tijdschrift beschrijving