CAPTCHA
2 + 1 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.
This question is for testing whether or not you are a human visitor and to prevent automated spam submissions.
  • Reset your password

User account menu

  • Log in
Home
Open Scholar Sphere

Main navigation

  • Home

Balanced Incomplete Block Design (BIBD) as traceable codes

Breadcrumb

  • Home
  • Balanced Incomplete Block Design (BIBD) as traceable codes

Anu Kathuria 1, * and Sudhir Batra 2

1 Department of Mathematics, The Technological Institute of Textile and Sciences, Bhiwani, Haryana, India.
2 Department of Mathematics, Deenbandhu Chhotu Ram University of Science and Technology, Murthal Sonepathal, India.

Research Article

International Journal of Science and Research Archive, 2023, 08(01), 734–739.
Article DOI: 10.30574/ijsra.2023.8.1.0165
DOI url: https://doi.org/10.30574/ijsra.2023.8.1.0165

Received on 02 January 2023; revised on 09 February 2023; accepted on 11 February 2023

Traceability Codes are Combinatorial Objects introduced by Chor, Fiat and Naor in 1994 [7] to be used in traitor tracing to protect illegal redistribution of Digital Content. Frameproof Codes were given by Boneh and Shaw in 1995 to prevent piracy. Traceable Codes is a strong form of frameproof codes due to efficient traitor tracing algorithm. Study of existence conditions of Balanced Incomplete Block Design in the form of frameproof codes is already available in literature. In the present study we discuss the existence conditions of Balanced Incomplete Block Design in the form of 2-Traceable Codes.

Balanced Incomplete Block Design (BIBD); Resolvable Balanced Incomplete Block Design (RBIBD); Traceable Codes; Mathematics

https://ijsra.net/node/1253

Preview Article PDF

Anu Kathuria and Sudhir Batra. Balanced Incomplete Block Design (BIBD) as traceable codes. International Journal of Science and Research Archive, 2023, 08(01), 734–739.  https://doi.org/10.30574/ijsra.2023.8.1.0165

Copyright © 2023 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0

Footer menu

  • Contact
Powered by Drupal

Copyright © 2025 Open Scholar Sphere - All rights reserved

Developed & Designed by VS WebTech