Let m, e be positive integers, p a prime number, Fpm be a finite field of p elements and R = Fpm [u]/〈u 〉 which is a finite chain ring. For any ω ∈ R and positive integers k, n satisfying gcd(p, n) = 1, we prove that any (1+ωu)-constacyclic code of length pn over R is monomially equivalent to a matrix-product code of a nested sequence of p cyclic codes with length n over R and a p × p matrix Ap...

This column is the seventh in a series about estimating. The first was in the July 1996 issue. The most recent several columns have focused on estimates based on lines of code (LOC). There are, however, several types of source code as well as many other important product types. Examples are new, modified, and reused code, as well as documentation, screens, reports, and files. The principal ques...

Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document describes a Uniform Resource Name (URN) namespace (RFC 3406) for the assignment of the Common Language Equipment Identifier (CLEI) code, which is used in messages standardized by ANSI. The URN namespac...

Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document describes a Uniform Resource Name (URN) namespace (RFC 3406) for the assignment of the Common Language Equipment Identifier (CLEI) code, which is used in messages standardized by ANSI. The URN namespac...

In this paper, we address the issue of automatic generation of disk-based algorithms from tensor product formulas. Disk-based algorithms are required in scientiic applications which work with large data sets that do not t entirely into main memory. Tensor products have been used for designing and implementing block recursive algorithms on shared-memory, vector and distributed-memory multiproces...

We present compiler technology for generating sparse matrix code from (i) dense matrix code and (ii) a description of the indexing structure of the sparse matrices. This technology embeds statement instances into a Cartesian product of statement iteration and data spaces, and produces efficient sparse code by identifying common enumerations for multiple references to sparse matrices. This appro...

Several properties of the products of finite maximal prefix, maximal biprefix, semaphore, synchronous, maximal infix and maximal outfix codes are discussed respectively. We show that, for two nonempty subsets X and Y of A such that the product XY being thin, if XY is a maximal biprefix code, then X and Y are maximal biprefix codes. Also, it is shown that, for two finite nonempty subsets X and Y...