Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

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
Full-text PDF (565 kB) Citations (1)
References:
PDF
HTML
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
English version:
Problems of Information Transmission, 2005, Volume 41, Issue 3, Pages 199–203
DOI: https://doi.org/10.1007/s11122-005-0024-4
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Leb05}
\by V.~S.~Lebedev
\paper Remark on the Uniqueness of $(w,r)$-Cover-Pree Codes
\jour Probl. Peredachi Inf.
\yr 2005
\vol 41
\issue 3
\pages 17--22
\mathnet{http://mi.mathnet.ru/ppi103}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2163847}
\zmath{https://zbmath.org/?q=an:1104.94058}
\transl
\jour Problems Inform. Transmission
\yr 2005
\vol 41
\issue 3
\pages 199--203
\crossref{https://doi.org/10.1007/s11122-005-0024-4}
Linking options:
  • https://www.mathnet.ru/eng/ppi103
  • https://www.mathnet.ru/eng/ppi/v41/i3/p17
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:303
    Full-text PDF :100
    References:51
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024