|
Problemy Peredachi Informatsii, 2005, Volume 41, Issue 3, Pages 17–22
(Mi ppi103)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
Remark on the Uniqueness of $(w,r)$-Cover-Pree Codes
V. S. Lebedev Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
A binary code is called a $(w,r)$ cover-free code if it is the incidence matrix of a
family of sets where the intersection of any w sets is not covered by the union of any other $r$ sets.
For certain $(w,r)$ cover-free codes with a simple structure, we obtain a new condition of optimality
and uniqueness up to row and/or column permutations.
Received: 01.02.2005 Revised: 05.05.2005
Citation:
V. S. Lebedev, “Remark on the Uniqueness of $(w,r)$-Cover-Pree Codes”, Probl. Peredachi Inf., 41:3 (2005), 17–22; Problems Inform. Transmission, 41:3 (2005), 199–203
Linking options:
https://www.mathnet.ru/eng/ppi103 https://www.mathnet.ru/eng/ppi/v41/i3/p17
|
Statistics & downloads: |
Abstract page: | 303 | Full-text PDF : | 100 | References: | 51 |
|