4ompetitively optimal coding is considered and the following is proved. 1) If the competitively optimal code exists for a glven source probability p(z), then it also attains the minimum expected codeword length 2) If the Huffman code tree for p(z) is unbalanced in probability weight, then the competitively optimal code does not exist. Furthermore, the relation between competitively optimal codi...

in this paper a discrete big bang-big crunch algorithm is applied to optimal design of reinforced concrete planar frames under the gravity and lateral loads. optimization is based on aci 318-08 code. columns are assumed to resist axial loads and bending moments, while beams resist only bending moments. second-order effects are also considered for the compression members, and columns are checked...

A parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the rst encoder are scrambled by the interleaver before entering the second encoder. The codewords of the parallel concatenated code consist of the information bits followed by the parity check bits of both encoders. Par...

Novel maximal coding compression techniques for the most important file-the text file of any full-text retrieval system are discussed in this paper. As a continuation of our previous work, we show that the optimal maximal coding schemes coincide with the optimal uniquely decodable coding schemes. An efficient algorithm generating an optimal maximal code (or an optimal uniquely decodable code) i...

We provide a variety of constructions of (n,w, λ)-optical orthogonal codes using special sets of points and Singer groups in finite projective spaces. In several of the constructions, we are able to prove that the resulting codes are optimal with respect to the Johnson bound. The optimal codes exhibited have λ = 1, 2 and w − 1 (where w is the weight of each codeword in the code). The remaining ...

The evolutionary forces that produced the canonical genetic code before the last universal ancestor remain obscure. One hypothesis is that the arrangement of amino acid/codon assignments results from selection to minimize the effects of errors (e.g., mistranslation and mutation) on resulting proteins. If amino acid similarity is measured as polarity, the canonical code does indeed outperform mo...