The error-correction code based proof-of-work (ECCPoW) algorithm is on a low-density parity-check (LDPC) code. ECCPoW possible to impair ASIC with its time-varying capability of the parameters LDPC Previous researches have presented theory and implementation Bitcoin. But they do not discuss how stable block generation time is. A finite mean (BGT) none heavy-tail BGT distribution are ones focus ...

This paper presents some results on multiple error detection and correction based on the Redundant Residue Number System (RRNS). RRNS. Encoding and decoding, Mixed error detection and error correction R4.4, R*4.2. 3. Projective plane codes, Fano plane, quadratic residue codes R*4.3, Latin. Abstract: This paper presents an error detection and data recovery (EDDR) design, based on the residueand-...

Abstracf-A study of the efficiency, error-correcting capabilities, and limitations of graph theoretic block codes is presented. Augmentation of graph theoretic codes and their generation is discussed. It is shown that such augmentation techniques can substantially increase the level of efficiency of these codes and potentially could increase it to the level of the best available codes. Furtherm...

• The code is error-correcting, i.e., even if a code word is changed to some extent (by error or maliciously), we can still decode it. This implies that the code words should be as different from each other as possible, since if, for example, there are two code words that are different in only one letter, then if this letter is changed, the decoding is wrong, thus the code is not even single-er...

New single asymmetric error-correcting codes are proposed. These codes are better than existing codes when the code length n is greater than 10, except for n = 12 and n = 15. In many cases one can construct a code C containing at least d2=ne codewords. It is known that a code with jCj d2=(n + 1)e can be easily obtained. It should be noted that the proposed codes for n = 12 and n = 15 are also t...

In this correspondence, we study binary asymmetric errorcorrecting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from th...

The joint source channel coding problem of transmitting a pair of correlated sources over a 2−user MAC is considered. A new concatenated coding scheme, comprising of an inner code of fixed block-length and an outer code of arbitrarily large block-length, is proposed. Its information theoretic performance is analyzed to derive a new set of sufficient conditions. An example is identified to demon...