On a Lower Bound for the Redundancy of Reliable Networks With Noisy Gates

IEEE Transactions on Information Theory - United States
doi 10.1109/18.79921
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

An Unequal Redundancy Level-Based Mechanism for Reliable Data Collection in Wireless Sensor Networks

Eurasip Journal on Wireless Communications and Networking
Computer NetworksComputer Science ApplicationsSignal ProcessingCommunications
2016English

A Lower Bound on the Subriemannian Distance for Hölder Distributions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2010English

The Minimax Distortion Redundancy in Noisy Source Coding

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2003English

Universal Quantum Computation With Ideal Clifford Gates and Noisy Ancillas

Physical Review A
2005English

A Lower Bound on the Tree-Width of Graphs With Irrelevant Vertices

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

On the Maximum Tolerable Noise of K-Input Gates for Reliable Computation by Formulas

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2003English

A Lower Bound for Jumbled Indexing

2020English

The Noisy Voter Model on Complex Networks

Scientific Reports
Multidisciplinary
2016English

A Lower Bound for the Rank of $J_0(q)$

Acta Arithmetica
Number TheoryAlgebra
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy