Bounds on the rate of disjunctive codes (Q2262991): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1401.0050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key storage in secure networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3489950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New constructions of superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3469037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the average error probability for a code ensemble with fixed composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic upper bound for the rate of \((w,r)\) cover-free codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superimposed Codes and Threshold Group Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonadaptive algorithms for threshold group testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of \((w,r)\) cover-free codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new bounds for cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Packing and Covering in the Boolean Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for union-free families of sets / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101529480 / rank
 
Normal rank

Latest revision as of 09:58, 30 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the rate of disjunctive codes
scientific article

    Statements

    Bounds on the rate of disjunctive codes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 March 2015
    0 references
    disjunctive \((s,\ell)\) cover-free codes
    0 references

    Identifiers