A balanced code with r check bits and k information is a binary of length k+r cardinality 2/sup k/ such that each codeword balanced; is, it has [(k+r)/2] 1's 0's. This paper contains new methods to construct efficient codes. To design code, an word low number or 0's compressed then using the saved space. On other hand, having almost same encoded single maps defined by Knuth's (1986) complementation method. Three different constructions are presented. Balanced codes k/spl les/2/sup r+1/-2,...

The choice of the best optimization algorithm is a hard issue, and it sometime depends on specific problem. Gravitational Search Algorithm (GSA) search based law gravity, which states that each particle attracts every other with force called gravitational force. Some revised versions GSA have been proposed by using intelligent techniques. This work proposes some fuzzy techniques powered evolutionary methods, such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO) Differential...

The goodness of Infinite Impulse Response (IIR) digital filters design depends on pass band ripple, stop ripple and transition values. main problem is defining a suitable error fitness function that these parameters. This can be optimized by search algorithms such as evolutionary algorithms. paper proposes an intelligent algorithm for the optimal 8th order IIR filters. contribution Fuzzy Inference Systems able to tune key parameters revisited version Gravitational Search Algorithm (GSA). In...

An m-ary block code, m = 2, 3, 4,..., of length n ϵ IN is called balanced if, and only every codeword balanced; that is, the real sum components, or weight, equal to ⌊(m - 1)n/2⌋. This paper presents efficient encoding schemes codes with parallel (hence, fast) decoding. In fact, decoding time complexity O(1) digit operations. These are a generalization alphabet Knuth's complementation method Let ( <sup xmlns:mml="http://www.w3.org/1998/Math/MathML"...

Let p be the 1 to 0 bit error probability and h(p)=-p log/sub 2/ p-(1-p) (1-p). The capacity of Z-channel is given by C/sub Z/=log/sub (1+(1-p)p/sup p/(1-p)/). For small p, it shown that Z//spl ap/1-(1/2)h(p) (vs., BS/(p)=1-h(p) for binary symmetric channel). Coding schemes are also almost achieve capacity.

Given the 1 to 0 bit error probability, pisin[0, 1], capacity of Z-channel is given by C <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">z</sub> =log xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> (1+p <sup xmlns:xlink="http://www.w3.org/1999/xlink">p/(1-p)</sup> -p xmlns:xlink="http://www.w3.org/1999/xlink">1/(1-p)</sup> ). Some new free feedback coding schemes that achieve are presented.

This paper gives some theory and design of efficient codes capable controlling (i. e., correcting/detecting/correcting erasure) errors measured under the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> distance defined over m-ary words, 2 ≤ m +∞. We give combinatorial characterizations such codes, general code designs decoding algorithms. Then, we a class linear systematic = sp with s∈IN p prime, which are d p-1 errors. If n k∈IN...

A new efficient design of second-order spectralnull (2-OSN) codes is presented. The are obtained by applying the technique used to parallel decoding balanced (i.e., 1-OSN) random walk method introduced some authors for designing 2-OSN codes. This gives non-recursive code designs, which less redundant than designs found in literature. In particular, if k ∈ IIN length a 1-OSN then coding scheme has n = + r with an extra redundancy ≃ 2 log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML"...

A general key equation based on elementary symmetric functions is developed for decoding some binary error control codes. Here, the syndrome obtained by computing (instead of power-sums) received word. new class codes introduced in this paper which can correct up to t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> 0 rarr 1 errors and, simultaneously, xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> errors. The be used decode and known...

A balanced code with k information bits and r check is a binary of length n=k+r cardinality 2/sup k/ such that the number 1s in each word equal to [n/2]. This paper describes design efficient codes parallel encoding decoding. In this case, since area delay circuits are critical factors, another parameter introduced definition code: "number balancing functions used design", p. Parallel decoding algorithms independent from chosen method given these can be implemented by VLSI circuit size O(pk)...

A constant weight, w, code with k information bits and r check is a binary of length n=k+r cardinality 2/sup k/ such that the number 1s in each word equal to w. When w=[n/2], called balanced. This paper describes design balanced weight codes parallel encoding decoding. Infinite families efficient are given parameters k, r, "number balancing functions used design," /spl rho/. The larger rho/ grows, smaller will be; can be encoded decoded VLSI circuits whose sizes depths proportional pk...

A symbol permutation invariant balanced (SPI-balanced) code over the alphabet Zopf <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sub> = {0, 1, ..., m - 1} is a block such that each occurs as many times any other in every codeword. For this reason, among symbols of changes an SPI-balanced into code. This means words are "the most balanced" all possible m-ary word types and property makes them very attractive from application perspective. In...

This paper gives the theory and design of efficient codes capable correcting errors caused by insertion deletion a repeated symbol in information sequence. Two methods are described. For any fixed t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sub> , xmlns:xlink="http://www.w3.org/1999/xlink">-</sub> ∈ IN, one method length scheme to encode k bits into systematic code n = + r, with r (t ) log...

Shannon in his 1956 seminal paper introduced the concept of zero error capacity, C <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> , a noisy channel. This is defined as least upper bound rates, at which, it possible to transmit information with probability error. At present not many codes are known achieve capacity. In this paper, some which capacities limited magnitude channels described. The code lengths these capacity achieving can be...

Let S (N,q) be the set of all words length N over bipolar alphabet (-1,+1), having a qth order spectral-null at zero frequency. Any subset is code and q. This correspondence gives an equivalent formulation S(N,q) in terms codes binary (0,1), shows that S(N,2) to well-known class single-error correcting unidirectional-error detecting (SEC-AUED) codes, derives explicit expression for redundancy S(N,2), presents new efficient recursive design methods second-order which are less redundant than...

In the automatic repeat request (ARQ) protocol, sender keeps retransmitting a code word until it receives positive acknowledgment from receiver sent through feedback channel. This correspondence proposes plain and diversity combining hybrid ARQ protocol communication schemes suitable for m(ges2)-ary asymmetric channel using t-asymmetric error correcting/all detecting (t-AEC/AAED) codes. The analysis shows that correction definitely improves throughput of system compared to which uses only...

Some new classes of systematic t-unidirectional error-detecting codes over Z <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sub> are designed. It is shown that the constructed can detect two errors using check digits. Furthermore, up to m <sup xmlns:xlink="http://www.w3.org/1999/xlink">r-2</sup> + r-2 r ges 3 bits. A bound on maximum number detectable digits also given.

Based on the elementary symmetric functions, this paper gives a new wide class of Goppa like codes capable correcting/detecting errors measured under (symmetric) L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> distance defined over m-ary words, 2 ≤ m +∞. All these can be efficiently decoded by algebraic means with Extended Euclidean Algorithm (EEA). In particular it is shown that if K any field characteristic char(K) ≠ 2, ϵ IN U {+∞}...

In an unordered code, no code word is contained in any other word. Unordered codes are all unidirectional error detecting (AUED) codes. the binary case, it well known that among systematic with <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> information bits, Berger optimal xmlns:xlink="http://www.w3.org/1999/xlink">r</i> =[log <sub xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> ( +1)] ≅ log check bits. This paper gives some new theory...