Improved Singleton bound on frequency hopping sequences and optimal constructions Xing LiuLiang Zhou OriginalPaper 20 October 2018 Pages: 1713 - 1733
Correction to: Improved Singleton bound on frequency hopping sequences and optimal constructions Xing LiuLiang Zhou Correction 16 February 2019 Pages: 1735 - 1736
Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices Léo DucasCécile Pierrot OriginalPaper 24 October 2018 Pages: 1737 - 1748
A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions Qichun WangPantelimon Stănică OriginalPaper 27 October 2018 Pages: 1749 - 1763
Codes with the rank metric and matroids Keisuke Shiromoto OriginalPaper 29 October 2018 Pages: 1765 - 1776
Nearly optimal robust secret sharing Mahdi Cheraghchi OriginalPaper Open access 01 November 2018 Pages: 1777 - 1796
Weightwise perfectly balanced functions with high weightwise nonlinearity profile Jian LiuSihem Mesnager OriginalPaper 10 November 2018 Pages: 1797 - 1813
Optimal binary constant weight codes and affine linear groups over finite fields Xiang-Dong Hou OriginalPaper 23 November 2018 Pages: 1815 - 1838
Cameron–Liebler sets of k-spaces in \({{\mathrm{PG}}}(n,q)\) A. BlokhuisM. De BoeckJ. D’haeseleer OriginalPaper 19 November 2018 Pages: 1839 - 1856
Additive perfect codes in Doob graphs Minjia ShiDaitao HuangDenis S. Krotov OriginalPaper 29 November 2018 Pages: 1857 - 1869
Transitive PSL(2,11)-invariant k-arcs in PG(4,q) Torger OlsonEric Swartz OriginalPaper 29 November 2018 Pages: 1871 - 1879
Uniqueness of codes using semidefinite programming Andries E. BrouwerSven C. Polak OriginalPaper Open access 30 November 2018 Pages: 1881 - 1895
An algorithmic framework for the generalized birthday problem Itai Dinur OriginalPaper 17 December 2018 Pages: 1897 - 1926
At most three-weight binary linear codes from generalized Moisio’s exponential sums Yansheng WuQin YueXueying Shi OriginalPaper 18 December 2018 Pages: 1927 - 1943
