The key objective of this paper is to study the cyclic codes over mixed alphabets on structure FqPQ, where P=Fq[v]⟨v3−α22v⟩ and Q=Fq[u,v]⟨u2−α12,v3−α22v⟩ are nonchain finite rings αi in Fq/{0} for i∈{1,2}, q=pm with m≥1 a positive integer p an odd prime. Moreover,with applications, we obtain better new quantum error-correcting (QEC) codes. For another application ring P, several optimal help Gr...

Optimal integrated code generation is a challenge in terms of problem complexity, but it provides important feedback for the resource-efficient design of embedded systems and is a valuable tool for the assessment of fast heuristics for code generation. We present a method for energy optimal integrated code generation for generic VLIW processor architectures that allows to explore trade-offs bet...

High quality code generation for irregular architectures, such as Digital Signal Processors, is a complex task, as it requires a fully integrated approach that simultaneously deals with the most important tasks of instruction selection, register allocation and instruction scheduling. We show how a fully integrated approach for optimal code generation based on dynamic programming can benefit fro...

In this correspondence, we propose some new designs of 2 2 unitary space-time codes of sizes 6; 32; 48; 64 with best known diversity products (or product distances) by partially using sphere packing theory. In particular, we present an optimal 2 2 unitary space-time code of size 6 in the sense that it reaches the maximal possible diversity product for 22 unitary space-time codes of size 6. The ...

To look at a piece of C code especially an uncommented one is often not very enlightening. Even small pieces of code with one or two functions will often appear to perform the same array initializations, loops over the data, and basic arithmetic functions, without clearly indicating what the overall purpose of the routine is. This can be frustrating to those using the code as part of a package ...

ALinear binary [n, k]-code is a k-dimensional subspaces of the n-dimensional vector space GF (2) over the finite field GF (2) with 2 elements. The 2 codewords of length n are the elements of the subspace, they are written as row vectors. The weight wt(c) of a codeword is defined to be the number of nonzero entries of c and the minimum distance dist(C) of a code C is the minimum of all weights o...

The genetic code is well-known to be fault tolerant, in the sense that transcription errors in the third codon position frequently do not influence the amino acid expressed, while errors in other codon positions often lead to amino acids having similar chemical properties. Several articles in the recent past ([?, ?, ?] etc.) have studied the question of optimality of the genetic code. In [?] Di...

During compilation of a program, register allocation is the task of mapping program variables to machine registers. During register allocation, the compiler may introduce shuffle code, consisting of copy and swap operations, that transfers data between the registers. Three common sources of shuffle code are conflicting register mappings at joins in the control flow of the program, e.g, due to i...