Code Cache Management Based on Working Set in Dynamic Binary Translator
Ruhui Ma, Haibing Guan, Erzhou Zhu, Yongqiang Gao, Alei Liang (2011)
Computer Science and Information Systems
Similarity:
Ruhui Ma, Haibing Guan, Erzhou Zhu, Yongqiang Gao, Alei Liang (2011)
Computer Science and Information Systems
Similarity:
Pavel Molchanov, Alexandr Totsky (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper presents a new noise immunity encoding/decoding technique by using the features of triple correlation and bispectrum widely employed in digital signal processing systems operating in noise environments. The triple correlationand bispectrum-based encoding/decoding algorithm is tested for a digital radio telecommunications binary frequency shift keying system. The errorless decoding probability was analyzed by means of computer simulation for the transmission and reception of...
Eugeniusz Kuriata (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.
Landjev, Ivan, Haralambiev, Kristiyan (2007)
Serdica Journal of Computing
Similarity:
In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion...
How, Guan Aun, Ang, Miin Huey (1998)
Bulletin of the Malaysian Mathematical Society. Second Series
Similarity:
Berger, Thierry, Todorov, Todor (2008)
Serdica Journal of Computing
Similarity:
The emergence of digital imaging and of digital networks has made duplication of original artwork easier. Watermarking techniques, also referred to as digital signature, sign images by introducing changes that are imperceptible to the human eye but easily recoverable by a computer program. Usage of error correcting codes is one of the good choices in order to correct possible errors when extracting the signature. In this paper, we present a scheme of error correction based on a combination...
Manev, Mladen (2009)
Serdica Journal of Computing
Similarity:
Partially supported by the Technical University of Gabrovo under Grant C-801/2008 One of the main problems in the theory of superimposed codes is to find the minimum length N for which an (N, T,w, r) superimposed code exists for given values of T , w and r. Let N(T,w, r) be the minimum length N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r) superimposed code is called optimal when N = N(T,w, r). The values of N(T, 1, 2) are known for T ≤ 12 and the values...
Baicheva, Tsonka (2007)
Serdica Journal of Computing
Similarity:
In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision...
Suparta, I Nengah (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uwe Naumann, Jan Riehme (2007)
Computer Science and Information Systems
Similarity:
Clelia De Felice (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set of operations exists such that each factorizing code can be obtained by using the operations in and starting with prefix or suffix codes. is named here a complete set of operations (for factorizing codes)....