{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T09:59:44Z","timestamp":1771667984175,"version":"3.50.1"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T00:00:00Z","timestamp":1448668800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10623-015-0149-4","type":"journal-article","created":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T05:25:32Z","timestamp":1448688332000},"page":"103-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Disjoint difference families and their applications"],"prefix":"10.1007","volume":"78","author":[{"given":"Siaw-Lynn","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maura Beth","family":"Paterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"key":"149_CR1","unstructured":"Ahmadi H., Safavi-Naini R.: Detection of algebraic manipulation in the presence of leakage. In: Padr\u00f3 C. (ed.) Proceedings of the 7th International Conference on Information Theoretic Security (ICITS) 2013. Lecture Notes in Computer Science, vol. 8317, pp. 238\u2013258. Springer, New York (2013)."},{"key":"149_CR2","unstructured":"Anderson I., Finizio N.J.: Whist tournaments. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, chap. 64, pp. 663\u2013668. Chapman and Hall\/CRC, Boca Raton (2007)."},{"key":"149_CR3","doi-asserted-by":"crossref","unstructured":"Araki T., Obana S.: Flaws in some secret sharing schemes against cheating. In: Pieprzyk J., Ghodosi H., Dawson E. (eds.) Proceedings of the 12th Australasian Conference on Information Security and Privacy (ACISP 2007), Townsville, 2\u20134 July 2007. Lecture Notes in Computer Science, vol. 4586, pp. 122\u2013132. Springer, New York (2007).","DOI":"10.1007\/978-3-540-73458-1_10"},{"key":"149_CR4","unstructured":"Bao J., Ji L.: New families of optimal frequency hopping sequence sets. CoRR. arXiv:1506.07372 (2015)."},{"key":"149_CR5","doi-asserted-by":"crossref","unstructured":"Bitan S., Etzion T.: Constructions for optimal constant weight cyclically permutable codes and difference families. IEEE Trans. Inf. Theory 41(1), 77\u201387 (1995).","DOI":"10.1109\/18.370117"},{"key":"149_CR6","doi-asserted-by":"crossref","unstructured":"Blackburn S.R.: Non-overlapping codes. IEEE Trans. Inf. Theory 61(9), 4890\u20134894 (2015).","DOI":"10.1109\/TIT.2015.2456634"},{"key":"149_CR7","doi-asserted-by":"crossref","unstructured":"Blundo C., De Santis A., Kurosawa K., Ogata W.: On a fallacious bound for authentication codes. J. Cryptol. 12(3), 155\u2013159 (1999).","DOI":"10.1007\/s001459900049"},{"key":"149_CR8","doi-asserted-by":"crossref","unstructured":"Broadbent A., Tapp A.: Information-theoretic security without an honest majority. In: Kurosawa K. (eds.) Advances in Crypotology\u2014ASIACRYPT 2007. Proceedings of the 13th International Conference on Theory and Application of Cryptology and Information Security. Lecture Notes in Computer Science, vol. 4833, pp. 410\u2013426. Springer, New York (2007).","DOI":"10.1007\/978-3-540-76900-2_25"},{"key":"149_CR9","doi-asserted-by":"crossref","unstructured":"Cabello S., Padr\u00f3 C., S\u00e1ez G.: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Cryptogr. 25(2), 175\u2013188 (2002).","DOI":"10.1023\/A:1013856431727"},{"key":"149_CR10","doi-asserted-by":"crossref","unstructured":"Cao H., Wei R.: Combinatorial constructions for optimal two-dimensional optical orthogonal codes. IEEE Trans. Inf. Theory 55(3), 1387\u20131394 (2009).","DOI":"10.1109\/TIT.2008.2011431"},{"key":"149_CR11","doi-asserted-by":"crossref","unstructured":"Chu W., Colbourn C.J.: Optimal frequency-hopping sequences via cyclotomy. IEEE Trans. Inf. Theory 51(3), 1139\u20131141 (2005).","DOI":"10.1109\/TIT.2004.842708"},{"key":"149_CR12","doi-asserted-by":"crossref","unstructured":"Chung F.R.K., Salehi J.A., Wei V.K.: Optical orthogonal codes: design, analysis and applications. IEEE Trans. Inf. Theory 35(3), 595\u2013604 (1989).","DOI":"10.1109\/18.30982"},{"key":"149_CR13","doi-asserted-by":"crossref","unstructured":"Churchill A.L.: Restrictions and generalizations on comma-free codes. Electron. J. Comb. 16(1) (2009). Research Paper R25.","DOI":"10.37236\/114"},{"key":"149_CR14","doi-asserted-by":"crossref","unstructured":"Colbourn C.J., Dinitz J.H.: Handbook of Combinatorial Designs (Discrete Mathematics and Its Applications), 2nd edn. Chapman & Hall\/CRC, Boca Raton (2006).","DOI":"10.1201\/9781420010541"},{"key":"149_CR15","unstructured":"Cramer R., Dodis Y., Fehr S., Padr\u00f3 C., Wichs D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. IACR Cryptol. ePrint Arch. 2008, 30 (2008)."},{"key":"149_CR16","doi-asserted-by":"crossref","unstructured":"Cramer R., Dodis Y., Fehr S., Padr\u00f3 C., Wichs D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart N.P. (eds.) Advances in Cryptology: EUROCRYPT 2008. Proceedings of the 27th International Conference on the Theory and Applications of Cryptographic Techniques. Lecture Notes in Computer Science, vol. 4965, pp. 471\u2013488. Springer, New York (2008).","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"149_CR17","doi-asserted-by":"crossref","unstructured":"Cramer R., Fehr S., Padr\u00f3 C.: Algebraic manipulation detection codes. Sci. China Math. 56(7), 1349\u20131358 (2013).","DOI":"10.1007\/s11425-013-4654-5"},{"key":"149_CR18","doi-asserted-by":"crossref","unstructured":"Cramer R., Padr\u00f3 C., Xing C.: Optimal algebraic manipulation detection codes in the constant-error model. In: Dodis Y., Nielsen J.B. (eds.) Proceedings of the 12th Theory of Cryptography Conference (TCC) 2015. Lecture Notes in Computer Science, vol. 9014, pp. 481\u2013501. Springer, New York (2015).","DOI":"10.1007\/978-3-662-46494-6_20"},{"key":"149_CR19","doi-asserted-by":"crossref","unstructured":"Dai P., Wang J., Yin J.: Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property. Des. Codes Cryptogr. 71(2), 315\u2013330 (2014).","DOI":"10.1007\/s10623-012-9733-z"},{"key":"149_CR20","doi-asserted-by":"crossref","unstructured":"Ding C., Fuji-Hara R., Fujiwara Y., Jimbo M., Mishima M.: Sets of frequency hopping sequences: bounds and optimal constructions. IEEE Trans. Inf. Theory 55(7), 3297\u20133304 (2009).","DOI":"10.1109\/TIT.2009.2021366"},{"key":"149_CR21","doi-asserted-by":"crossref","unstructured":"Ding C., Salomaa A., Sol\u00e9 P., Tian X.: Three constructions of authentication\/secrecy codes. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp. 24\u201333. Springer, New York (2003).","DOI":"10.1007\/3-540-44828-4_4"},{"key":"149_CR22","doi-asserted-by":"crossref","unstructured":"Ding C., Tian X.: Three constructions of authentication codes with perfect secrecy. Des. Codes Cryptogr. 33(3), 227\u2013239 (2004).","DOI":"10.1023\/B:DESI.0000036248.82691.11"},{"key":"149_CR23","doi-asserted-by":"crossref","unstructured":"Ding C., Yang Y., Tang X.: Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inf. Theory 56(7), 3605\u20133612 (2010).","DOI":"10.1109\/TIT.2010.2048504"},{"key":"149_CR24","unstructured":"Dixon R.C.: Spread Spectrum Systems, 2nd edn. Wiley, Chichester (1984)"},{"key":"149_CR25","unstructured":"Dziembowski S., Pietrzak K., Wichs D.: Non-malleable codes. In: Yao A.C. (ed.) Proceedings of the Innovations in Computer Science (ICS) 2010, pp. 434\u2013452. Tsinghua University Press, Beijing (2010)."},{"key":"149_CR26","doi-asserted-by":"crossref","unstructured":"Emek Y., Wattenhofer R.: Frequency hopping against a powerful adversary. In: Afek Y. (eds.) Distributed Computing. Lecture Notes in Computer Science, vol. 8205, pp. 329\u2013343. Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-41527-2_23"},{"key":"149_CR27","doi-asserted-by":"crossref","unstructured":"Feng T., Chang Y.: Combinatorial constructions for optimal two-dimensional optical orthogonal codes with $$\\lambda =2$$ \u03bb = 2 . IEEE Trans. Inf. Theory 57(10), 6796\u20136819 (2011).","DOI":"10.1109\/TIT.2011.2165805"},{"key":"149_CR28","doi-asserted-by":"crossref","unstructured":"Fuji-Hara R., Miao Y., Mishima M.: Optimal frequency hopping sequences: a combinatorial approach. IEEE Trans. Inf. Theory 50(10), 2408\u20132420 (2004).","DOI":"10.1109\/TIT.2004.834783"},{"key":"149_CR29","doi-asserted-by":"crossref","unstructured":"Fuji-Hara R., Miao Y., Shinohara S.: Complete sets of disjoint difference families and their applications. J. Stat. Plan. Inference 106(1\u20132), 87\u2013103 (2002).","DOI":"10.1016\/S0378-3758(02)00205-7"},{"key":"149_CR30","doi-asserted-by":"crossref","unstructured":"Fujiwara Y., Tonchev V.D.: High-rate self-synchronizing codes. IEEE Trans. Inf. Theory 59(4), 2328\u20132335 (2013).","DOI":"10.1109\/TIT.2012.2234501"},{"key":"149_CR31","doi-asserted-by":"crossref","unstructured":"Ge G., Miao Y., Wang L.: Combinatorial constructions for optimal splitting authentication codes. SIAM J. Discret. Math. 18(4), 663\u2013678 (2005).","DOI":"10.1137\/S0895480103435469"},{"key":"149_CR32","doi-asserted-by":"crossref","unstructured":"Ge G., Miao Y., Yao Z.: Optimal frequency hopping sequences: auto- and cross-correlation properties. IEEE Trans. Inf. Theory 55(2), 867\u2013879 (2009).","DOI":"10.1109\/TIT.2008.2009856"},{"key":"149_CR33","doi-asserted-by":"crossref","unstructured":"Ge S., Wang Z., Karpovsky M., Luo P.: Reliable and secure memories based on algebraic manipulation detection codes and robust error correction. In: Proceedings of the Sixth International Conference on Dependability (DEPEND) (2013).","DOI":"10.1109\/IOLTS.2012.6313861"},{"key":"149_CR34","doi-asserted-by":"crossref","unstructured":"Ge S., Wang Z., Luo P., Karpovsky M.: Secure memories resistant to both random errors and fault injection attacks using nonlinear error correction codes. In: Proceedings of the 2nd International Workshop on Hardware and Architectural Support for Security and Privacy, p. 5. ACM (2013).","DOI":"10.1145\/2487726.2487731"},{"key":"149_CR35","doi-asserted-by":"crossref","unstructured":"Golomb S.W., Gong G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005).","DOI":"10.1017\/CBO9780511546907"},{"key":"149_CR36","doi-asserted-by":"crossref","unstructured":"Golomb S.W., Gordon B., Welch L.R.: Comma-free codes. Can. J. Math. 10(2), 202\u2013209 (1958).","DOI":"10.4153\/CJM-1958-023-9"},{"key":"149_CR37","unstructured":"Guruswami V., Smith A.: Optimal-rate code constructions for computationally simple channels. CoRR. arXiv:1004.4017 (2010)."},{"key":"149_CR38","doi-asserted-by":"crossref","unstructured":"He X., Yener A.: Secure communication with a byzantine relay. In: IEEE International Symposium on Information Theory (ISIT) 2009, pp. 2096\u20132100. IEEE, Piscataway (2009)","DOI":"10.1109\/ISIT.2009.5205271"},{"key":"149_CR39","doi-asserted-by":"crossref","unstructured":"He X., Yener A.: Strong secrecy and reliable byzantine detection in the presence of an untrusted relay. IEEE Trans. Inf. Theory 59(1), 177\u2013192 (2013).","DOI":"10.1109\/TIT.2012.2216952"},{"key":"149_CR40","unstructured":"Helleseth T.: Sequence correlation. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, chap. 7, pp. 313\u2013317. Chapman and Hall\/CRC, Boca Raton (2007)."},{"key":"149_CR41","doi-asserted-by":"crossref","unstructured":"Hirschfeld J.W.P.: Projective Geometries over Finite Fields (Oxford Mathematical Monographs), 2nd edn. Oxford University Press, Oxford (1998).","DOI":"10.1093\/oso\/9780198502951.001.0001"},{"key":"149_CR42","doi-asserted-by":"crossref","unstructured":"Hoshino H., Obana S.: Almost optimum secret sharing schemes with cheating detection for random bit strings. In: Tanaka K., Suga Y. (eds.) Advances in Information and Computer Security. Proceedings of the 10th International Workshop on Security, (IWSEC) 2015. Lecture Notes in Computer Science, vol. 9241, pp. 213\u2013222. Springer, New York (2015).","DOI":"10.1007\/978-3-319-22425-1_13"},{"key":"149_CR43","doi-asserted-by":"crossref","unstructured":"Huber M.: Authentication and secrecy codes for equiprobable source probability distributions. In: IEEE International Symposium on Information Theory (ISIT) 2009, pp. 1105\u20131109. IEEE, Piscataway (2009).","DOI":"10.1109\/ISIT.2009.5206028"},{"key":"149_CR44","doi-asserted-by":"crossref","unstructured":"Huber M.: Combinatorial bounds and characterizations of splitting authentication codes. Cryptogr. Commun. 2(2), 173\u2013185 (2010).","DOI":"10.1007\/s12095-010-0020-4"},{"key":"149_CR45","doi-asserted-by":"crossref","unstructured":"Huber M.: Combinatorial designs for authentication and secrecy codes. Found. Trends Commun. Inf. Theory 5(6), 581\u2013675 (2010).","DOI":"10.1561\/0100000044"},{"key":"149_CR46","unstructured":"Huber M.: Information theoretic authentication and secrecy codes in the splitting model. CoRR. arXiv:1112.0038 . (2011)."},{"key":"149_CR47","doi-asserted-by":"crossref","unstructured":"Jiang J., Wu D., Fan P.: General constructions of optimal variable-weight optical orthogonal codes. IEEE Trans. Inf. Theory 57(7), 4488\u20134496 (2011).","DOI":"10.1109\/TIT.2011.2146110"},{"key":"149_CR48","doi-asserted-by":"crossref","unstructured":"Karpovsky M., Wang Z.: Design of strongly secure communication and computation channels by nonlinear error detecting codes. IEEE Trans. Comput. 63(11), 2716\u20132728 (2014).","DOI":"10.1109\/TC.2013.146"},{"key":"149_CR49","doi-asserted-by":"crossref","unstructured":"Kurosawa K., Obana S.: Combinatorial bounds on authentication codes with arbitration. Des. Codes Cryptogr. 22(3), 265\u2013281 (2001).","DOI":"10.1023\/A:1008398306907"},{"key":"149_CR50","doi-asserted-by":"crossref","unstructured":"Lempel A., Greenberger H.H.: Families of sequences with optimal Hamming-correlation properties. IEEE Trans. Inf. Theory 20(1), 90\u201394 (1974).","DOI":"10.1109\/TIT.1974.1055169"},{"key":"149_CR51","doi-asserted-by":"crossref","unstructured":"Levenshtein V.I.: Combinatorial problems motivated by comma-free codes. J. Comb. Des. 12(3), 184\u2013196 (2004).","DOI":"10.1002\/jcd.10071"},{"key":"149_CR52","doi-asserted-by":"crossref","unstructured":"Liang M., Du B.: A new class of 3-fold perfect splitting authentication codes. Des. Codes Cryptogr. 62(1), 109\u2013119 (2012).","DOI":"10.1007\/s10623-011-9496-y"},{"key":"149_CR53","doi-asserted-by":"crossref","unstructured":"Liang M., Du B.: A new class of splitting 3-designs. Des. Codes Cryptogr. 60(3), 283\u2013290 (2011).","DOI":"10.1007\/s10623-010-9433-5"},{"key":"149_CR54","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol. 20, 2nd edn. Cambridge University Press, Cambridge (1997)."},{"key":"149_CR55","doi-asserted-by":"crossref","unstructured":"Liu F., Peng D., Zhou Z., Tang X.: A new frequency-hopping sequence set based upon generalized cyclotomy. Des. Codes Cryptogr. 69(2), 247\u2013259 (2013).","DOI":"10.1007\/s10623-012-9652-z"},{"key":"149_CR56","doi-asserted-by":"crossref","unstructured":"Luo P., Lin A.Y.-L., Wang Z., Karpovsky M.: Hardware implementation of secure Shamir\u2019s secret sharing scheme. In: Proceedings of the IEEE 15th International Symposium on High-Assurance Systems Engineering (HASE) 2014, pp. 193\u2013200. IEEE, Piscataway (2014).","DOI":"10.1109\/HASE.2014.34"},{"key":"149_CR57","unstructured":"Luo P., Wang Z., Karpovsky M.: Secure NAND flash architecture resilient to strong fault-injection attacks using algebraic manipulation detection code. In: Proceedings of the International Conference on Security and Management (SAM) 2013. The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp) (2013)."},{"key":"149_CR58","doi-asserted-by":"crossref","unstructured":"Mpitziopoulos A., Gavalas D., Konstantopoulos C., Pantziou G.: A survey on jamming attacks and countermeasures in WSNs. IEEE Commun. Surv. Tutor. 11(4), 42\u201356 (2009).","DOI":"10.1109\/SURV.2009.090404"},{"key":"149_CR59","unstructured":"Nyirenda M., Ng S.L., Martin K.M.: A combinatorial model of interference in frequency hopping schemes. CoRR. arXiv:1508.02570 . (2015)."},{"key":"149_CR60","doi-asserted-by":"crossref","unstructured":"Obana S., Araki T.: Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution. In: Lai X., Chen K. (eds.) Advances in Cryptology: ASIACRYPT 2006. Proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security. Lecture Notes in Computer Science, vol. 4284, pp. 364\u2013379. Springer, New York (2006).","DOI":"10.1007\/11935230_24"},{"key":"149_CR61","doi-asserted-by":"crossref","unstructured":"Obana S., Kurosawa K.: Bounds and combinatorial structure of $$(k, n)$$ ( k , n ) multi-receiver A-codes. Des. Codes Cryptogr. 22(1), 47\u201363 (2001).","DOI":"10.1023\/A:1008351225940"},{"key":"149_CR62","doi-asserted-by":"crossref","unstructured":"Obana S., Tsuchida K.: Cheating detectable secret sharing schemes supporting an arbitrary finite field. In: Yoshida M., Mouri K. (eds.) Advances in Information and Computer Security. Proceedings of the 9th International Workshop on Security, IWSEC 2014. Lecture Notes in Computer Science, vol. 8639, pp. 88\u201397. Springer, New York (2014).","DOI":"10.1007\/978-3-319-09843-2_7"},{"key":"149_CR63","unstructured":"Obana S.: Almost optimum $$t$$ t -cheater identifiable secret sharing schemes. In: Paterson K.G. (eds.) Advances in Cryptology : EUROCRYPT 2011. Proceedings of the 30th International Conference on the Theory and Applications of Cryptographic Techniques. Lecture Notes in Computer Science, vol. 6632, pp. 284\u2013302. Springer, New York (2011)."},{"key":"149_CR64","doi-asserted-by":"crossref","unstructured":"Ogata W., Kurosawa K., Stinson D.R., Saido H.: New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discret. Math. 279(13), 383\u2013405 (2004). (In Honour of Zhu Lie)","DOI":"10.1016\/S0012-365X(03)00283-8"},{"key":"149_CR65","doi-asserted-by":"crossref","unstructured":"Ogata W., Kurosawa K., Stinson D.R.: Optimum secret sharing scheme secure against cheating. SIAM J. Discret. Math. 20(1), 79\u201395 (2006).","DOI":"10.1137\/S0895480100378689"},{"key":"149_CR66","doi-asserted-by":"crossref","unstructured":"Paterson M.B., Stinson D.R.: Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. CoRR. arXiv:1506.02711 . (2015).","DOI":"10.1016\/j.disc.2016.06.004"},{"key":"149_CR67","doi-asserted-by":"crossref","unstructured":"Pei D.: Authentication Codes and Combinatorial Designs (Discrete Mathematics and Its Applications) CRC Press, Boca Raton (2006).","DOI":"10.1201\/9781420003185"},{"key":"149_CR68","doi-asserted-by":"crossref","unstructured":"Peng D., Fan P.: Lower bounds on the hamming auto- and cross correlations of frequency-hopping sequences. IEEE Trans. Inf. Theory 50(9), 2149\u20132154 (2004).","DOI":"10.1109\/TIT.2004.833362"},{"key":"149_CR69","doi-asserted-by":"crossref","unstructured":"Pott A., Kumaran V., Helleseth T., Jungnickel D.: Difference Sets, Sequences and Their Correlation Properties. Nato ScienceSeries C. Springer, Dordrecht (1999).","DOI":"10.1007\/978-94-011-4459-9"},{"key":"149_CR70","doi-asserted-by":"crossref","unstructured":"Sarwate D.V.: Optimum PN sequences for CDMA systems. In: Glisic S.G., Lepp\u00e4nen P.A. (eds.) Code Division Multiple Access Communications, pp. 53\u201378. Springer, New York (1995).","DOI":"10.1007\/978-1-4615-2251-5_4"},{"key":"149_CR71","unstructured":"Stinson D.R., Wei R.: Bibliography on authentication codes. http:\/\/cacr.uwaterloo.ca\/~dstinson\/acbib.html (1998)."},{"key":"149_CR72","unstructured":"Tompa M., Woll H.: How to share a secret with cheaters. J. Cryptol. 1(2), 133\u2013138 (1988)."},{"key":"149_CR73","unstructured":"Tonchev V.D.: Difference systems of sets and code synchronization. Rendiconti del Seminario Matematico di Messina Series II 9, 217226 (2003)."},{"key":"149_CR74","doi-asserted-by":"crossref","unstructured":"Wang Z., Karpovsky M.G.: Algebraic manipulation detection codes and their applications for design of secure cryptographic devices. In: Proceedings of the 17th IEEE International On-Line Testing Symposium (IOLTS 2011), pp. 234\u2013239. IEEE, Piscataway (2011)","DOI":"10.1109\/IOLTS.2011.5994535"},{"key":"149_CR75","unstructured":"Wang Z., Karpovsky M.: New error detecting codes for the design of hardware resistant to strong fault injection attacks. In: Proceedings of the International Conference on Security and Management (SAM) 2012. The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp) (2012)."},{"key":"149_CR76","doi-asserted-by":"crossref","unstructured":"Wang P., Safavi-Naini R.: An efficient code for adversarial wiretap channel. In: IEEE Information Theory Workshop (ITW) 2014, pp. 40\u201344. IEEE, Piscataway (2014)","DOI":"10.1109\/ITW.2014.6970788"},{"key":"149_CR77","doi-asserted-by":"crossref","unstructured":"Wang J., Su R.: Further results on the existence of splitting BIBDs and application to authentication codes. Acta Appl. Math. 109(3), 791\u2013803 (2010)","DOI":"10.1007\/s10440-008-9346-8"},{"key":"149_CR78","doi-asserted-by":"crossref","unstructured":"Wang J.: A new class of optimal 3-splitting authentication codes. Des. Codes Cryptogr. 38(3), 373\u2013381 (2006).","DOI":"10.1007\/s10623-005-1501-x"},{"key":"149_CR79","doi-asserted-by":"crossref","unstructured":"Wen B.: Construction of optimal sets of frequency hopping sequences. ISRN Combinatorics (Article ID 479408) (2013).","DOI":"10.1155\/2013\/479408"},{"key":"149_CR80","doi-asserted-by":"crossref","unstructured":"Xia T., Xia B.: Quasi-cyclic codes from extended difference families. In: Proceedings of the IEEE Wireless Communications and Networking Conference, pp. 1036\u20131040. IEEE (2005).","DOI":"10.1109\/WCNC.2005.1424651"},{"key":"149_CR81","doi-asserted-by":"crossref","unstructured":"Xu W., Trappe W., Zhang Y., Wood T.: The feasibility of launching and detecting jamming attacks in wireless networks. In: Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc \u201905), pp. 46\u201357. ACM, New York (2005).","DOI":"10.1145\/1062689.1062697"},{"key":"149_CR82","doi-asserted-by":"crossref","unstructured":"Yu N.Y., Zhao N.: Deterministic construction of real-valued ternary sensing matrices using optical orthogonal codes. IEEE Signal Process. Lett. 20(11), 1106\u20131109 (2013).","DOI":"10.1109\/LSP.2013.2281597"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0149-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0149-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0149-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:50:53Z","timestamp":1748706653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0149-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,28]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["149"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0149-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,28]]}}}