An improved syndrome shift-register decoding algorithm, called the syndrome-weight decoding algorithm, is proposed for decoding three possible errors and detecting four errors in the (24,12,8) Golay code. This method can also be extended to decode two other short codes, such as the (15,5,7) cyclic code and the (31,16,7) quadratic residue (QR) code. The proposed decoding algorithm makes use of t...

We give an algorithm for generating cyclic self-orthogonal (CSO) codes for an arbitrary positive integer n with gcd(n; q) = 1. Given a cyclic q-ary code of length n, we determine how many codes isomorphic to the given code are cyclic. We introduce a mass formula for CSO(n; q) codes of maximum dimension. Using the mass formula we classify CSO(63; 2) codes. This mass formula works for any cyclic ...

In this chapter the expression “holonic cyclic manufacturing systems” refers to complex assembly/disassembly systems or fork/join systems, kanban systems, and in general, to any discrete event system that transforms raw material and/or components into products. Such a system is said to be cyclic if it provides the same sequence of products indefinitely. This chapter considers the scheduling of ...

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

Abstarct In this paper, combination of channel, receiver frequency-dependent IQ imbalance and carrier frequency offset estimation under short cyclic prefix (CP) length are considered in OFDM system. An adaptive algorithm based on the set-membership filtering (SMF) algorithm is used to compensate for these impairments. In short CP length, per-tone equalization (PTEQ) structure is used to avoid i...

Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, there is a performance tradeoff between the efficiency of new data decomposition for a subsequent phase of an algorithm and the cost of redistributing data among processors. In this paper, we present efficient algorithms for...