A systematic method of designing TSC checker for Q class (even code length) of Borden’s code [l] is proposed, where a modular approach is used. In a comparative study, it is found that the proposed method is much better than [2,3] and it has a larger capability than [4,5] in designing the checker. For instance, the 3/12 code in C(12,2) can be identified in one of four ways, corresponding to PT’...

Background: Skin cancer can be treated by various methods. Electron radiotherapy has been a useful therapeutic modality in the treatment of skin cancers in areas which are difficult to cure by other methods. Depth dose distribution of 166Ho using VARSKIN2 code is presented in this work. Material and Methods: Depth dose distribution of 166Ho was calculated, using VARSKIN2 code by adding...

Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. The information sets and the minimum distance of a code can be derived from the corresponding ELC orbit. By extending earlier results on local complementation (LC) orbits, we classify the ELC orbits of al...

in this paper, we propose space-time block codes based on constituent intersectant orthogonal designs. after channel model is formulated, we studied the space-time block codes from constituent intersectant orthogonal designs. at last we made simulations for the space-time block codes from complex orthogonal design and the space-time block codes from constituent intersectant orthogonal design to...

A bound is obtained which generalizes the Carlitz-Uchiyama result, based on a theorem of Bombieri and Weil about exponential sums. This new bound is used to estimate the covering radius of long binary Goppa codes. A new lower bound is also derived on the minimum distance of the dual of a binary Goppa code, similar to that for BCH codes. This is an example of the use of a number-theory bound for...

This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length or maximum redundancy and average redundancy, including a convex combination of the average of an exponential function of the codeword length and the average redundancy. This framework encompasses as a special case several criteria previousl...

The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is, codes that can be decoded through a polynomial time algorithm A whose decoding bound is beyond the covering radius. For these codes, we show that the maximum-likelihood decoding problem is reachable in polynomial tim...

Few weights codes have been an important topic of coding theory for decades. In this paper, a class of two-weight and three-weight codes for the homogeneous metric over the chain ring R = Fp + uFp + · · ·+ uFp are constructed. These codes are defined as trace codes. They are shown to be abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, we giv...