Code Design for Dependable Systems
From MaRDI portal
Publication:5484947
DOI10.1002/0471792748zbMATH Open1140.94002OpenAlexW4246578358MaRDI QIDQ5484947FDOQ5484947
Authors: Eiji Fujiwara 
Publication date: 23 August 2006
Full work available at URL: https://doi.org/10.1002/0471792748
Recommendations
- Design and Analysis of Reliable and Fault-Tolerant Computer Systems
- scientific article; zbMATH DE number 791870
- scientific article; zbMATH DE number 1734135
- scientific article; zbMATH DE number 1708136
- scientific article; zbMATH DE number 705197
- scientific article; zbMATH DE number 791863
- scientific article; zbMATH DE number 3890717
error correcting codesdistributed storage systemslogic circuitsmatrix codehigh-speed semiconductor memory
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Analytic circuit theory (94C05) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cited In (16)
- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
- The MacWilliams identity for \(m\)-spotty weight enumerators of linear codes over finite fields
- Title not available (Why is that?)
- Applications of modular summation codes to concurrent error detection systems for combinational Boolean circuits
- Synthesis of self-checking combination devices based on allocating special groups of outputs
- Title not available (Why is that?)
- Title not available (Why is that?)
- New structures of the concurrent error detection systems for logic circuits
- Boolean-complement based fault-tolerant electronic device architectures
- Coding approaches to fault tolerance in combinational and dynamic systems
- Sum codes with fixed values of multiplicities for detectable unidirectional and asymmetrical errors for technical diagnostics of discrete systems
- Conditions for detecting a logical element fault in a combination device under concurrent checking based on Berger's code
- Title not available (Why is that?)
- Complete m-spotty weight enumerators of binary codes, Jacobi forms, and partial Epstein zeta functions
- Code design of \(l_{t_i/n_i}\)-ispotty-byte error correcting \(\theta\)-codes
- Integer codes correcting burst asymmetric within a byte and double asymmetric errors. [Integer codes correcting burst asymmetric errors within a byte and double asymmetric errors]
This page was built for publication: Code Design for Dependable Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484947)
