Constructions of r-identifying codes and (r, ≤ l)-identifying codes

R. Dhanalakshmi () and C. Durairajan ()
Additional contact information
R. Dhanalakshmi: Bharathidasan University
C. Durairajan: Bharathidasan University

Indian Journal of Pure and Applied Mathematics, 2019, vol. 50, issue 2, 531-547

Abstract: Abstract In binary Hamming space, we construct r-identifying codes from a $$\sum\limits_{i = 0}^{r - 1} {\left({\matrix{n \cr i \cr}} \right) + \left({\matrix{{n - 1} \cr {r - 1} \cr}} \right) + 1} $$ ∑ i = 0 r − 1 ( n i ) + ( n − 1 r − 1 ) + 1 -fold r-covering code. By using this construction, we modify the construction of r-identifying codes of Charon et al. which helps to find codes of greater length. From this modified construction, we improve the upper bound of M5 (23) which is the smallest possible cardinality of a 5-identifying code of length 23. We also construct (2, ≤ l) -identifying codes and we define the length function L(r, l) as the smallest positive integer n for which there exists an (r, ≤ l)-identifying code in $$\mathbb{F}_{2}^{n}$$ F 2 n . By using the construction of (2, ≤ l)-identifying codes, we improve the upper bounds of L(2, l) for all l ≥ 6. We also improve the upper bounds of M 2 (≤ l) (n) for all l ≥ 6 and when n is one more than the improved upper bound of L(2, l). We give the construction for (r, ≤ l)-identifying codes. From this result, we prove that M r (≤ l) (2r +1) ≤ 22r for certain values of r and l.

Keywords: Binary Hamming spaces; covering codes; code construction; identifying codes; direct sum (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-019-0343-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:50:y:2019:i:2:d:10.1007_s13226-019-0343-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-019-0343-6

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().