Journal: Des. Codes Cryptography

Volume 71, Issue 3

365 -- 381Mingzhi Zhu, Gennian Ge. Room squares with super-simple property
383 -- 407Vladimir Anashin, Andrei Khrennikov, Ekaterina Yurova. T-functions revisited: new criteria for bijectivity/transitivity
409 -- 431Christophe Petit. Towards factoring in $${SL(2, \, \mathbb{F}_{2^n})}$$
433 -- 457Maura B. Paterson, Douglas R. Stinson. A unified approach to combinatorial key predistribution schemes for sensor networks
459 -- 478Johannes Braun 0001, Johannes Buchmann, Ciaran Mullan, Alexander Wiesmaier. Long term confidentiality: a survey
479 -- 492Anthony B. Evans. Mutually orthogonal Latin squares based on general linear groups
493 -- 501Nam Yul Yu, Keqin Feng, Aixian Zhang. A new class of near-optimal partial Fourier codebooks from an almost difference set
503 -- 524Klara Stokes, Oriol Farràs. Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes
525 -- 0Klara Stokes, Oriol Farràs. Erratum to: Linear spaces and transversal designs: $$k$$ -anonymous combinatorial configurations for anonymous database search
527 -- 539Wakaha Ogata, Hiroshi Eguchi. Cheating detectable threshold scheme against most powerful cheaters for long secrets
541 -- 545Susan G. Barwick, Wen-Ai Jackson. A characterisation of tangent subplanes of PG(2, q 3)

Volume 71, Issue 2

183 -- 199Sihong Su, Xiaohu Tang. Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity
201 -- 227Yun Fan, San Ling, Hongwei Liu. Matrix product codes over finite commutative Frobenius rings
229 -- 246Alexander Zeh, Sergey Bezzateev. A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
247 -- 260Tomas Nilson, Pia Heidtmann. Inner balance of symmetric designs
261 -- 281Antonia Wachter-Zeh, Alexander Zeh, Martin Bossert. Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
283 -- 291Peter Dukes, Lea Howard. Group divisible designs in MOLS of order ten
293 -- 313Reza Sepahi, Ron Steinfeld, Josef Pieprzyk. Lattice-based completely non-malleable public-key encryption in the standard model
315 -- 330Peipei Dai, Jianmin Wang 0003, Jianxing Yin. Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
331 -- 346Caixue Zhou, Wan Zhou, Xiwei Dong. Provable certificateless generalized signcryption scheme
347 -- 364Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang. The relation and transformation between hierarchical inner product encryption and spatial encryption

Volume 71, Issue 1

1 -- 4Aart Blokhuis, Andries E. Brouwer, Attila Sali. Note on the size of binary Armstrong codes
5 -- 19Hiram H. Lopez, Carlos Rentería-Márquez, Rafael H. Villarreal. Affine cartesian codes
21 -- 46Daniele Bartoli, Maarten De Boeck, Stefania Fanali, Leo Storme. On the functional codes defined by quadrics and Hermitian varieties
47 -- 56Guangfu Wu, Hsin-Chiu Chang, Lin Wang, Trieu-Kien Truong. Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory
57 -- 81Nigel P. Smart, Frederik Vercauteren. Fully homomorphic SIMD operations
83 -- 103Thijs Laarhoven, Benne de Weger. Optimal symmetric Tardos traitor tracing schemes
105 -- 118Pierre Loidreau. Asymptotic behaviour of codes in rank metric over finite fields
119 -- 152Anuradha Sharma, Amit K. Sharma. On some new m-spotty Lee weight enumerators
153 -- 162S. Arumugam, R. Lakshmanan, Atulya K. Nagar. On (k, n)*-visual cryptography scheme
163 -- 181Tian Tian, Wen-Feng Qi. On the largest affine sub-families of a family of NFSR sequences