In global scheduling for ILP processors, regionenlarging optimizations, especially tail duplication, are commonly used. The code size increase due to such optimizations, however, raises serious concerns about the affected I-cache and TLB performance. In this paper, we propose a quantitative measure of the code size efficiency at compile time for any code size related optimization. Then, based o...

Abstract In 2006, K. Feng, L. Xu and F. J. Hickernell initiated the concept of a linear error-block code which is a natural generalization of the classical linear code. In this correspondence, we investigate optimal linear errorblock codes in two directions: maximal dimension codes and maximal minimum π-distance codes. First perspective on optimizing a code is by studying lower bounds and upper...

Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981 16], and in the same paper, gave an asymptotically-optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of the Preparata-Vuillemin layout. We also give a non-trivial lower bound on the layout area of the CCC. There is a constant factor of 2 between the new lay...

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods o...

Let C be a q-ary code of length n and size M , and C(i) = {c(i) | c = (c(1), c(2), . . . , c(n)) ∈ C} be the set of ith coordinates of C. The descendant code of a sub-code C ′ ⊆ C is defined to be C ′ (1) × C ′ (2) × · · · × C ′ (n). In this paper, we introduce a multimedia analogue of codes with the identifiable parent property (IPP), called multimedia IPP codes or t-MIPPC(n,M, q), so that giv...

One of hypotheses explaining the origin of the genetic code assumes that its evolution has minimised the deleterious effects of mutations in coded proteins. To estimate the level of such optimization, we calculated optimal codes for genes located on differently replicating DNA strands separately assuming the rate of amino acid substitutions in proteins as a measure of code’s susceptibility to e...

We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit simplex. Such setting yields precise asymptotic characterization in the high-rate regime. Our main contribution is a simple and asymptotically optimal algorithm fo...

We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0.