TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

Traceable codes formed using certain combinatorial designs

*

* Corresponding author · click or hover a name for details

pp. 2473–2482Vol. 27Issue 8December 2024DOI: 10.47974/JDMSC-2072 Crossmark XML
Received:
05 Jan 2024
Published Online:
18 Dec 2024
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2072
Pages:
2473–2482

Abstract

In paper of Staddon and Wei [4] ; there were open problems  (1) “ Do there exist w- IPP codes with the property w < q < [(w + 2)2 / 4] ? ” (2) “Can we construct interesting w-TA(w-traceable) codes with n < q and q < w2 ? ”  Here in this paper we give that answer and suggest some Combinatorial Designs which meet the above conditions and prove them to be 2-TA and 3-TA Codes. In this paper our spotlight is mainly on Equireplicate Codes and Lexicographic Codes where each element occurs equally often. A few of these codes discussed in (Sinha et. al.2008) are also experimental to be excellent Equidistant Constant Weight Codes 

Keywords

Equireplicate codeLexicographic code and equidistant constant weight code

Subject Classifications

12F0512F0612G15

References

[1] A. Kathuria, S. Batra, and S. K. Arora, “On traceability property of equidistant codes,” Discrete Math., vol. 340, no. 4, pp. 713–721, Apr. (2017).
[2] Anu Kathuria, Sudhir Batra and S.K. Arora “ A class of 2-FP Codes” Journal of Information and Optimization Sciences, Taylor and Francis, vol.38, issue 8, pg.1311-1324, December (2017). 
[3] Anu Kathuria, Sudhir Batra “ On Algebraic Conditions of Equidistant Codes ” International Journal of Science and Research Archive”, vol.8 Issue 2, pg. 575-588, April (2023).
[4] B. Chor, A. Fiat and M. Naor , “Tracing Traitors”, in Advances in Cryptology – CRYPTO 94 (Lecture Notes in Computer Science) Berlin, Germany, Springer Verlag, vol. 839, pp. 257-270 (1994).
[5] D. Boneh and J. Shaw, “Collusion –Secure fingerprinting for Digital Data”, IEEE Transactions on Information Theory, vol. 44, pp. 1897-1905 (1998).
[6] Fang-Wei Fu, Torleiv Klove ,Yuan Luo “On Equidistant Constant Weight Codes” Discrete Applied Mathematics, 128, pg. 157-164 (2003). 
[7] H. D. L. Hollman, J. H. Van Lint, and J.-P. Linnartz, “On Codes with the identifiable parent property,” J. Combin. Theory, Ser. A, vol. 82, pp. 121–133 (1998).
[8] J.H. Conway and N.J.A Sloane, “Lexicographic Codes : Error – Correcting codes from game Theory” IEEE Transactions on Information Theory, vol. 32, pp. 337- 348 (1986). 
[9] J.N. Staddon, D.R. Stinson and R. Wei ,“ Combinatorial Properties of Frameproof and Traceable Codes” IEEE Transactions on Information Theory, vol.47, pp. 1042-1049 (2001).
[10] R. Krishna 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), doi: 10.1080/09720529.2020.179452.
[11] N. Alon, C. J. Colbourn, A. C. Ling, and M. Tompa, “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. Manag., vol. 2, pp. 183–187 (2010).

Views: 162Downloads: 8Citations: 0