Optimizing traceable codes with Latin squares and projective planes
*Anu KathuriaCorresponding authoranu_sept24@rediffmail.comDepartment of MathematicsThe Technological Institute of Textile and SciencesBhiwani, Haryana, 127021, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 14 Aug 2024
- Published Online:
- 02 Jun 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2301
- Pages:
- 2359–2369
Abstract
Keywords
Subject Classifications
References
[1] A. Kathuria and S. Batra, “On traceability property of equidistant codes,” J. Discrete Math., vol. 7, pp. 713–721 (2017).
[2] A. Kathuria, S. Batra, and S. K. Arora, “A class of 2-FP codes,” J. Inf. Optim. Sci., vol. 38, no. 8, pp. 1311–1324 (Dec. 2017).
[3] A. Kathuria and S. Batra, “On algebraic conditions of equidistant codes,” Int. J. Sci. Res. Arch., vol. 8, no. 2, pp. 575–588 (Apr. 2023).
[4] J. N. Staddon, D. R. Stinson, and R. Wei, “Combinatorial properties of frameproof and traceable codes,” IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 1042–1049 (2001).
[5] D. Boneh and J. Shaw, “Collusion-secure fingerprinting for digital data,” IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1897–1905 (1998).
[6] H. D. L. Hollmann, J. H. van Lint, and J.-P. Linnartz, “On codes with the identifiable parent property,” J. Combin. Theory Ser. A, vol. 82, no. 1, pp. 121–133 (1998).
[7] B. Chor, A. Fiat, and M. Naor, “Tracing traitors,” in Advances in Cryptology – CRYPTO ‘94, Lecture Notes in Computer Science, vol. 839, Berlin, Germany: Springer-Verlag, pp. 257–270 (1994).
[8] B. Victor, Aspects of Combinatorics, Cambridge, U.K.: Cambridge Univ. Press (1993).
[9] C. J. Colbourn and J. H. Dinitz, The CRC Handbook of Combinatorial Designs, Boca Raton, FL, USA: CRC Press (1996).
[10] A. Kathuria, “Combinatorial properties of some fingerprinting models and linear codes,” Ph.D. dissertation, Maharshi Dayanand Univ., Rohtak, India (Dec. 2013).
[11] N. Alon, C. J. Colbourn, and A. C. H. Ling, “Equireplicate balanced binary codes for oligo arrays,” SIAM J. Discrete Math., vol. 14, no. 4, pp. 481–497 (2001).
[12] T. Todorov, G. Bogdanova, and T. Yorgova, “Lexicographic constant weight equidistant codes over the alphabet of three, four and five elements,” J. Intell. Inf. Manage., vol. 2, pp. 183–187 (2010).
[13] J. H. Conway and N. J. A. Sloane, “Lexicographic codes: Error-correcting codes from game theory,” IEEE Trans. Inf. Theory, vol. 32, no. 3, pp. 337–348 (1986).
[14] F.-W. Fu, T. Kløve, and Y. Luo, “On equidistant constant weight codes,” Discrete Appl. Math., vol. 128, no. 1, pp. 157–164 (2003).
[15] R. K. Kumari, R. Arulprakasam, and V. R. Dare, “Combinatorial properties of Fibonacci partial words and arrays,” J. Discrete Math. Sci. Cryptogr., vol. 24, no. 4, pp. 1007–1020 (2021). [Online]. Available: https://doi.org/10.1080/09720529.2020.179452
[16] M. Al-Seraji, N. A. Alnussiary, and Z. S. Jafar, “The group action on the finite projective planes of orders 53, 61, 64,” J. Discrete Math. Sci. Cryptogr., vol. 23, no. 8, pp. 1573–1582 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2020.1773020
[17] A. Kathuria, “Traceable codes constructed using certain combinatorial designs,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 8, pp. 2563–2572 (2024). [Online]. Available: https://doi.org/10.47974/JDMSC-2072.
