in this paper, an enhanced computational code was developed using finite-volume method for solving the incompressible natural convection flow within the cylindrical cavities. grids were generated by an easy method with a view to computer program providing. an explicit integration algorithm was applied to find the steady state condition. also instead of the conventional algorithms of simple, sim...

We propose a general class of concatenated errorcorrecting entropy codes and channel codes. In this way we extend and generalize the existing body of work on iterative decoding of entropy and channel codes. Using the structure and properties of serial concatenated codes, we employ error-correcting entropy codes as the outer code, and a convolutional code as the inner code. The generalization fr...

In this paper, an enhanced computational code was developed using finite-volume method for solving the incompressible natural convection flow within the cylindrical cavities. Grids were generated by an easy method with a view to computer program providing. An explicit integration algorithm was applied to find the steady state condition. Also instead of the conventional algorithms of SIMPLE, SIM...

In present communication, we have developed the suitable constraints for the given the mean codeword length and the measures of entropy. This development has proved that Renyi’s entropy gives the minimum value of the log of the harmonic mean and the log of power mean. We have also developed an important relation between best 1:1 code and the uniquely decipherable code by using different measure...

We define and investigate the notion of entropy for quantum error correcting codes. The entropy of a code for a given quantum channel has a number of equivalent realisations, such as through the coefficients associated with the Knill-Laflamme conditions and the entropy exchange computed with respect to any initial state supported on the code. In general the entropy of a code can be viewed as a ...

Chain codes are the most size-efficient representations of rasterised binary shapes and contours. This paper considers a new lossless chain code compression method based on move-to-front transform and an adaptive run-length encoding. The former reduces the information entropy of the chain code, whilst the latter compresses the entropy-reduced chain code by coding the repetitions of chain code s...

Motivated by the approach of random linear codes, a new distance in the vector space over a finite field is defined as the logarithm of the “surface area” of a Hamming ball with radius being the corresponding Hamming distance. It is named entropy distance because of its close relation with entropy function. It is shown that entropy distance is a metric for a non-binary field and a pseudometric ...