A code C is said to be Z2Z4-additive if its coordinates can be partitioned into two subsets X and Y , in such a way that the punctured code of C obtained by removing the coordinates outside X (or, respectively, Y ) is a binary linear code (respectively, a quaternary linear code). The binary image of a Z2Z4-additive code, through the Gray map, is a Z2Z4-linear code, which is not always linear. G...

In this article, we present a technique that allows us to generate parallel tiled code calculate general linear recursion equations (GLRE). That deals with multidimensional data and it is computing-intensive. We demonstrate dependencies available in an original computing GLREs do not allow any because there only one solution the time partition constraints built for program. show how transform a...

A number of upper and lower bounds are obtained for K( n, R), the minimal number of codewords in any binary code of length n and covering radius R. Several new constructions are used to derive the upper bounds, including an amalgamated direct sum construction for nonlinear codes. This construction works best when applied to normal codes, and we give some new and stronger conditions which imply ...

Using integer linear programming and table-lookups we prove that there is no binary linear [1988, 12, 992] code. As a byproduct, the non-existence of binary linear [324, 10, 160], [356, 10, 176], [772, 11, 384], and [836, 11, 416] codes is shown. On the other hand, there exists a linear (994, 4, 992) code over Z4. Its Gray image is a binary non-linear (1988, 2, 992) code. Therefore, we can add ...

Asymptotic concentration behaviors of linear combinations of weight distributions on the random linear code ensemble are presented. Many important properties of a binary linear code can be expressed as the form of a linear combination of weight distributions such as number of codewords, undetected error probability and upper bound on the maximum likelihood error probability. The key in this ana...