Revisiting BIBDs : 3-frameproof and 2-traceable properties for large block sizes
*Anu KathuriaCorresponding authoranu_sept24@rediffmail.comDepartment of Applied Sciences and HumanitiesThe Technological Institute of Textile & SciencesBhiwani, Haryana, 127021, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Aug 2025
- Published Online:
- 12 May 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-2213
- Pages:
- 2293–2303
Abstract
Keywords
Subject Classifications
References
[1] A. Kathuria, S. K. Arora, and S. Batra, “On traceability property of equidistant codes,” Journal of Discrete Mathematics, vol. 340, pp. 713–721 (2017).
[2] A. Kathuria, S. Batra, and S. K. Arora, “A class of 2-FP codes,” Journal of Information and Optimization Sciences, vol. 38, no. 8, pp. 1311–1324 (Dec. 2017).
[3] A. Kathuria, “Traceable codes constructed from certain combinatorial designs,” Journal of Discrete Mathematics and Cryptography, vol. 27, no. 8, pp. 2473–2482, doi: 10.47974/JDMSC-2072.
[4] A. Kathuria, “Optimizing traceable codes through Latin squares and projective planes,” Journal of Discrete Mathematics and Cryptography, doi: 10.4974/JDMSC-2301.
[5] A. Kathuria, “BIBDs as 2-TA codes,” International Journal of Science and Research Archive, doi: 10.30574/ijsra.2023.8.1.0165.
[6] D. R. Stinson and R. Wei, “Combinatorial properties and constructions of traceability schemes and frameproof codes,” SIAM Journal on Discrete Mathematics, vol. 2, pp. 41–53 (1998).
[7] C. J. Colbourn and J. H. Dinitz, The CRC Handbook of Combinatorial Designs. Boca Raton, FL, USA: CRC Press (1996).
[8] J. Staddon, D. R. Stinson, and R. Wei, “Combinatorial properties of frameproof and traceable codes,” IEEE Transactions on Information Theory, vol. 47, no. 3, pp. 1042–1049 (2001).
[9] F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Murray Hill, NJ, USA: Bell Laboratories (1978).
[10] T. Lindkvist, J. Löfvenberg, and M. Svanström, “A class of traceability codes,” IEEE Transactions on Information Theory, vol. 48, no. 7, pp. 2094–2096 (2002).
[11] S. R. Blackburn, “Frameproof codes,” SIAM Journal on Discrete Mathematics, vol. 16, no. 3, pp. 499–510.
[12] D. Boneh and J. Shaw, “Collusion-secure fingerprinting for digital data,” IEEE Transactions on Information Theory, vol. 44, pp. 1897–1905 (1998).
[13] R. A. Fisher and F. Yates, Design Theory. New York, NY, USA: Nova Publishers (2007).
[14] A. Kathuria, “Understanding traceable codes: A review of their functionality and importance,” Journal of Information and Optimization Sciences, doi: 10.47974/JIOS-2187.
