We present a matrix language compiler CMC which translates annotated MATLAB scripts into Fortran 90 programs. Distinguishing features of CMC include its applicability to programs with sparse matrix computations and its capability of source-level optimization in MATLAB language. Different from other existing similar translators, CMC has an ability to generate codes based on information on the sh...

The adjacency matrix of a graph can be interpreted as the incidence matrix of a design, or as the generator matrix of a binary code. Here these relations play a central role. We consider graphs for which the corresponding design is a (symmetric) block design or (group) divisible design. Such graphs are strongly regular (in case of a block design) or very similar to a strongly regular graph (in ...

In this paper, we consider a class of column-weight two quasi-cyclic low-density parity check codes in which the girth can be large enough, as an arbitrary multiple of 8. Then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. Finally, we show that the free distance of the convolutio...

In many credit risk and pricing applications, credit transition matrix is modeled by a constant transition probability or generator matrix for Markov processes. Based on empirical evidence, we model rating transition processes as piecewise homogeneous Markov chains with unobserved structural breaks. The proposed model provides explicit formulas for the posterior distribution of the time-varying...

Let R be a finite chain ring (e.g. a Galois ring), K its residue field and C a linear code over R. We prove that d(C), the Hamming distance of C, is d((C : α)), where (C : α) is a submodule quotient, α is a certain element of R and denotes the canonical projection to K. These two codes also have the same set of minimal codeword supports. We explicitly construct a generator matrix/polynomial of ...

A model for multiplexed video sources and the resulting packet delay distribution for a fluid buffer is given. A measurement driven Markov chain based traffic model for a variable bit rate (VBR) source is used in the analysis. A characterization of the queueing delays of a multiplexed stream comprised of statistically identical sources is undertaken.. It is shown that inadequate spectral conten...

In this paper, we implement a revised pseudo random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix HN with the aim of calculating the pseudo random sequences of N bits employing the algorithm related to the automaton backward evolution. In addition, a multifractal structure of the matrix HN is revealed and quantified according to the multif...

We prove that for any positive integers n and k such that n≥ k≥ 1, there exists an [n, k] generalized Reed-Solomon (GRS) code that has a sparsest and balanced generator matrix (SBGM) over any finite field of size q ≥ n+ ⌈ k(k−1) n ⌉, where sparsest means that each row of the generator matrix has the least possible number of nonzeros, while balanced means that the number of nonzeros in any two c...

Let R be a finite chain ring (e.g. a Galois ring), K its residue field and C a linear code over R. We prove that d(C), the Hamming distance of C, is d((C : α)), where (C : α) is a submodule quotient, α is a certain element of R and denotes the canonical projection to K. These two codes also have the same set of minimal codeword supports. We explicitly construct a generator matrix/polynomial of ...