We suggest a transformation of supports of a clutter family. It is a natural generalization of the untying transformation of a one-clutter support previously introduced by the author. We show that the new transformation does not decrease the reliability of the corresponding clutter sum. We give new bounds for the clutter-sum reliability. We demonstrate that the untying transformation of clutter-family supports and the factor transformation introduced by McDiarmid provide a combinatorial basis for the monotone-structure reliability theory.
Problems of Information Transmission – Springer Journals
Published: Oct 7, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud