The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. GHWs are of great interest in many applications since they convey detailed information of linear codes. In this paper, we continue the work of [10] to study the GHWs of a family of cyclic codes with arbitrary number of nonzeroes. The weight hierarchy is determined by employing a number-theoretic approach.

We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity for a fixed permutation of the code. We examine constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code. We identify the primitive structures that can appear in a minimal trellis and relate this to those for the ...

In this paper, we describe source code transformations based on sw-pipelining, loop unrolling, and loop fusion for the sparse matrix-vector multiplication and for the Conjugate Gradient algorithm that enable data prefetching and overlapping of load and FPU arithmetic instructions and improve the temporal cache locality. We develop a probabilistic model for estimation of the numbers of cache mis...

This paper presents an effective method for improving the performance of speaker identification system based on the multiresolution properly of the wavelet transform, the input speech signal is decomposed into L subbands. To capture the characteristic of the vocal tract, the liner prediction code of each band (including the linear predictive code (LPC)for full band) are calculated. The feature ...

Advances in speech coding technologies have enabled speech coders to achieve bit-rate reductions at a great extent while maintaining roughly the same speech quality. One of the most important driving forces behind this feat is the analysis-by-synthesis paradigm. Code Excited Linear Predictive coder (CELP) is the quite efficient closed loop analysis-by-synthesis method for narrow and medium band...

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...

l . INTRODUCTION A class of double error correcting linear convolutional codes are given. T h e codes are derived from double-error-correct ing tr iple-error-detect ing extended BCH codes. T h e codes being proposed are not covered by previous works ([7], [2], [3]). Error propagation in the proposed codes is discussed. For the sake of simplicity of arguments only binary codes are discussed. Ext...

Introduction: In radiation therapy, in order to double-check the dosimetric results of the main treatment planning system (TPS), a distinct TPS, with few capacitances in terms of contouring and a variety of dose calculation algorithms is used. This system has the capability to double check the planification and the accurate prediction of dose distribution in order to be ensured...