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

IEEE Transactions on Information Theory - United States
doi 10.1109/tit.2003.818405
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Reliable Computation by Formulas in the Presence of Noise

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

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

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

Reliable Positioning Domain Computation for Urban Navigation

IEEE Intelligent Transportation Systems Magazine
Automotive EngineeringComputer Science ApplicationsMechanical Engineering
2013English

On Reliable Communications Over Channels Impaired by Bursty Impulse Noise

IEEE Transactions on Communications
Electronic EngineeringElectrical
2009English

Fermionic Formulas for $(K,3)$-Admissible Configurations

Publications of the Research Institute for Mathematical Sciences
Mathematics
2004English

Comparison Between Formulas of Maximum Ship Squat

Scientific Bulletin of Naval Academy
2016English

Reliable Scalable Symbolic Computation: The Design of SymGridPar2

Computer Languages, Systems and Structures
Computer NetworksSoftwareCommunications
2014English

Multiple-Input Distortionless Filters for Estimating Signals Corrupted by Noise

English

Reliable Computation With Cellular Automata

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1986English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy