Journal: Des. Codes Cryptography

Volume 87, Issue 10

2185 -- 2197Xin Wang, Jie Cui, Lijun Ji. Linear (2, p, p)-AONTs exist for all primes p
2199 -- 2212Nuh Aydin, Jonathan G. G. Lambrinos, Oliver VandenBerg. On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
2213 -- 2230Liang Bai, Zihui Liu. On the third greedy weight of 4-dimensional codes
2231 -- 2250Matvei Kotov, Anton Menshov, Alexander Ushakov. An attack on the Walnut digital signature algorithm
2251 -- 2265Junying Liu, Yupeng Jiang, Qunxiong Zheng, Dongdai Lin. A new construction of zero-difference balanced functions and two applications
2267 -- 2294Tian Tian 0004, Jia-Min Zhang, Wen-Feng Qi. On the uniqueness of a type of cascade connection representations for NFSRs
2295 -- 2320Umberto Martínez-Peñas. Theory of supports for linear codes endowed with the sum-rank metric
2321 -- 2333Qichun Wang. Hadamard matrices, d-linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights
2335 -- 2340R. Sobhani, A. Abdollahi, J. Bagherian, M. Khatami. A note on good permutation codes from Reed-Solomon codes
2341 -- 2360Hadi Kharaghani, Sho Suda. Linked systems of symmetric group divisible designs of type II
2361 -- 2374Jon-Lark Kim, Junyong Park, Soohak Choi. Steganographic schemes from perfect codes on Cayley graphs
2375 -- 2389Bhaskar Bagchi. A coding theoretic approach to the uniqueness conjecture for projective planes of prime order
2391 -- 2393Minglong Qi, Shengwu Xiong. A correction to: on the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
2395 -- 2404Minjia Shi, Patrick Solé. Three-weight codes, triple sum sets, and strongly walk regular graphs
2405 -- 2417José Ándrés Armario, D. L. Flannery. Generalized binary arrays from quasi-orthogonal cocycles
2419 -- 2446Yuan Cao 0001, Yonglin Cao, Steven T. Dougherty, San Ling. 4 of oddly even length
2447 -- 2460Shuxing Li. On the weight distribution of second order Reed-Muller codes and their relatives