Series-3 (May – June 2023)May – June 2023 Issue Statistics
- Citation
- Abstract
- Reference
- Full PDF
- Index Page
- Cover Paper
Paper Type | : | Research Paper |
Title | : | A Class of 3 –TA Codes |
Country | : | |
Authors | : | Anu Kathuria |
: | 10.9790/5728-1903030104 |
Abstract : In this paper we propose an explicit construction of a new class of 3-TA (Traceable Codes) of size (2n-2) and length ( 2n-2), n > 1. By the definition of Traceable code in [3] for a code C being 3-TA , minimum distance d of the code is given by d >(1−1𝑐2 )n, n is the length of the code and c defines the number of colluders. In that paper we have tried to give the answer of the open problem mentioned in [4 ]. Can we design c-TA codes for which q <𝑐2also ? , q defines the size of field and 𝑐 defines the number of colluders.
Keywords: Traceable (TA) Code, Hamming Code, Latin Square, Combinatorics.
[1]. B. Chor, A. Fiat and M. Naor, "Tracing Traitors" ,Crypto'94 (Lecture Notes in Computer Science),Berlin, Heidelberg ,New York ,vol.839, pp.480-491, 1994.
[2]. D. Boneh and J. Shaw," Collusion secure fingerprinting for Digital Data" in Advances in Cryptology-CRYPTO '95 (Lecture Notes in Computer Science),vol. 963,pp.463-465,New York ,1995.
[3]. D. Boneh and J. Shaw," Collusion secure fingerprinting for Digital Data" IEEE Transactions on Information Theory ,vol.44,pp. 1897-1905,1998.
[4]. D.R. Stinson , R. Wei ,"Combinatorial Properties and Constructions of traceability schemes and frameproof codes" SIAM Journal of Discrete Mathematics, vol.2 ,pp. 41-53,1998.
[5]. D.R. Stinson , T. Van Trung, R. Wei ,"Secure frameproof codes, Key Distribution Patterns and related structures "J. Statistical Planning Inference vol. 86(2),(2000),pp. 595-617.
- Citation
- Abstract
- Reference
- Full PDF
Abstract :This Study Focuses On Even Sum Property Of Graphs In The Context Of Subdivision, Super Subdivision .....
Keywords: Even Sum Labeling, Even Sum Graph, Subdivision, Super Subdivision, Arbitrary Super Subdivision
[1]. Rosa A. On certain valuation of the vertices of a graph. Theory of Graphs (Rome, July 1966), Gordon and Beach. N.Y. and Paris. 1967; 349–355.
[2]. Gallian JA. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics. 2021; 24: # DS6.
[3]. Arockiaraj S, Mahalakshmi P. On odd sum graphs. International Journal of Mathematical Combinatorics. 2013; 4: 58–77.
[4]. Trivedi MM, Chaudhary Venus. Odd sum labeling for complete bipartite graph and its splitting and subdivision. International Journal of Theoretical & Applied Sciences. 2022; 14(2): 26–31.
[5]. Monika K, Murugan K. Odd-even sum labeling of some graphs. International Journal of Mathematics and Soft Computing. 2017; 7(1): 57–63.