[1] E. F. Assmus, Jr. and J. D. Key, Designs and their codes, vol. 103 of Cambridge Tracts in Mathematics, Cambridge University Press, Cambridge, 1992.
[2] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, Lee distance and topological properties of k-ary n-cubes, IEEE Trans. Comput., 44 (1995), pp. 1021–1030.
[3] W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput., 24 (1997), pp. 235–265.
[4] J. Cannon, A. Steel, and G. White, Linear codes over finite fields, Handbook of Magma Functions (j. cannon and w. bosma, eds.), computational algebra group, department of mathematics, university of sydney, 2006, v2. 13.
[5] K. Day and A. E. Al-Ayyoub, Fault diameter of k-ary n-cube networks, IEEE Transactions on Parallel and Distributed Systems, 8 (1997), pp. 903–907.
[6] W. Fish, Codes from uniform subset graphs and cycle products, PhD thesis, University of the Western Cape, 2007.
[7] W. Fish, Binary codes and partial permutation decoding sets from the Johnson graphs, Graphs Combin., 31 (2015), pp. 1381–1396.
[8] , Binary codes and permutation decoding sets from the graph products of cycles, Appl. Algebra Engrg. Comm. Comput., 28 (2017), pp. 369–386.
[9] W. Fish, R. Fray, and E. Mwambene, Binary codes and partial permutation decoding sets from the odd graphs, Cent. Eur. J. Math., 12 (2014), pp. 1362–1371.
[10] W. Fish, J. Key, and E. Mwambene, Special lcd codes from products of graphs, Applicable Algebra in Engineering, Communication and Computing, (2021), pp. 1–27.
[11] W. Fish, J. D. Key, and E. Mwambene, Codes, designs and groups from the hamming graphs, J. Combin. Inform. System Sci., 34 (2009), pp. 169–182.
[12] , Graphs, designs and codes related to the n-cube, Discrete Math., 309 (2009), pp. 3255–3269.
[13] , Binary codes from designs from the reflexive n-cube, Util. Math., 85 (2011), pp. 235–246.
[14] W. Fish, J. D. Key, E. Mwambene, and B. G. Rodrigues, Hamming graphs and special LCD codes, J. Appl. Math. Comput., 61 (2019), pp. 461–479.
[15] D. M. Gordon, Minimal permutation sets for decoding the binary Golay codes, IEEE Trans. Inform. Theory, 28 (1982), pp. 541–543.
[16] W. H. Haemers, R. Peeters, and J. M. van Rijckevorsel, Binary codes of strongly regular graphs, Des. Codes Cryptogr., 17 (1999), pp. 187–209.
[17] W. C. Huffman, Codes and groups, in Handbook of coding theory, Vol. I, II, North-Holland, Amsterdam, 1998, pp. 1345–1440.
[18] J. Key and B. G. Rodrigues, Minimal P D-sets for codes associated with the graphs Qm 2 , m even, Appl. Algebra Engrg. Comm. Comput., (2021), pp. 1–10.
[19] J. D. Key and J. Limbupasiriporn, Partial permutation decoding for codes from Paley graphs, in Proceedings of the Thirty-Fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 170, 2004, pp. 143–155.
[20] J. D. Key, T. P. McDonough, and V. C. Mavron, Partial permutation decoding for codes from finite planes, European J. Combin., 26 (2005), pp. 665–682.
[21] , Information sets and partial permutation decoding for codes from finite geometries, Finite Fields Appl., 12 (2006), pp. 232–247.
[22] , Improved partial permutation decoding for Reed-Muller codes, Discrete Math., 340 (2017), pp. 722–728.
[23] J. D. Key, J. Moori, and B. G. Rodrigues, Binary codes from graphs on triples, Discrete Math., 282 (2004), pp. 171–182.
[24] , Partial permutation decoding of some binary codes from graphs on triples, Ars Combin., 91 (2009), pp. 363–371.
[25] , Ternary codes from graphs on triples, Discrete Math., 309 (2009), pp. 4663–4681.
[26] , Codes associated with triangular graphs and permutation decoding, Int. J. Inf. Coding Theory, 1 (2010), pp. 334–349.
[27] J. D. Key and B. G. Rodrigues, LCD codes from adjacency matrices of graphs, Appl. Algebra Engrg. Comm. Comput., 29 (2018), pp. 227–244.
[28] , Special LCD codes from Peisert and generalized Peisert graphs, Graphs Combin., 35 (2019), pp. 633–652.
[29] J. D. Key and B. G. Rodrigues, Binary codes from m-ary n-cubes Qm n , Adv. Math. Commun., 15 (2021), pp. 507–524.
[30] J. D. Key and P. Seneviratne, Permutation decoding for binary self-dual codes from the graph Qn where n is even, in Advances in coding theory and cryptography, vol. 3 of Ser. Coding Theory Cryptol., World Sci. Publ., Hackensack, NJ, 2007, pp. 152–159.
[31] J. D. Key and P. Seneviratne, Partial permutation decoding for MacDonald codes, Appl. Algebra Engrg. Comm. Comput., 27 (2016), pp. 399–412.
[32] H.-J. Kroll, Remarks on the paper “Binary codes from designs from the reflexive n-cube”. Private communication, 2020.
[33] H.-J. Kroll and R. Vincenti, PD-sets related to the codes of some classical variates, Discrete Appl. Math, 301 (2005), pp. 89–105.
[34] H.-J. Kroll and R. Vincenti, Antiblocking decoding, Discrete Appl. Math., 158 (2010), pp. 1461–1464.
[35] F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes. I, North-Holland Mathematical Library, Vol. 16, North-Holland Publishing Co., Amsterdam-New York-Oxford, 1977.
[36] J. Macwilliams, Permutation decoding of systematic codes, Bell Syst. Tech. J., 43 (1964), pp. 485–505.
[37] J. L. Massey, Linear codes with complementary duals, vol. 106/107, 1992, pp. 337–342. A collection of contributions in honour of Jack van Lint.
[38] J. Schonheim ¨ , On coverings, Pacific J. Math., 14 (1964), pp. 1405–1411.