This paper introduces a new counting code. Its design was motivated by distributed video coding where, for decoding, error correction methods are applied to improve predictions. Those error corrections sometimes fail which results in decoded values worse than the initial prediction. Our code exploits the fact that bit errors are relatively unlikely events: more than a few bit errors in a decode...

Developing code over a long period of time, in a heterogeneous team or under time pressure can lead to a lingering decay in readability, maintainability and thus reusability of software source code. In the past decades several approaches have been developed that tackle automatic detection of such code Waws, yet neglecting the automated correction as an essential and integrated step in the refac...

We study the relation between locally testable and locally decodable codes. Locally testable codes (LTCs) are error-correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. Locally decodable codes (LDCs) allow to recover each message entry with high probability by reading only a few entries of a slightly corrupted c...

Background: Estimating dosimetric parameters for small fields under non-reference conditions leads to significant errors if done based on conventional protocols used for large fields in reference conditions. Hence, further correction factors have been introduced to take into account the influence of spectral quality changes when various detectors are used in non-reference conditions at differen...

This paper demonstrates two improvements in coding techniques that could be used for memory word coding. First, within the fixed structure of a Hamming single-error-correcting, double-errordetecting (SEC/DED) code, an improvement can be obtained in circuit cost and operational speed over more conventional code implementations. Second, the mechanics of error correction in a fault-tolerant comput...

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...