For a positive integer $ b\ge2 $, the b $-symbol code is new coding framework proposed to combat $-errors in read channels. Especially, 2 called symbol-pair code. Remarkably, classical maximum distance separable (MDS) also an MDS Recently, for any \mathcal{C} Ma and Luo determined weight distribution of $. In this paper, by calculating number solutions some equations utilizing shortened codes w...

A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.

In this article, we concerned with the performance of high rate space time block code (STBC) scheme for Frequency selective fading Environment. Due to large channel delay spread in Frequency selective channel inter symbol interference (ISI) occurred. In high rate STBC, ISI occurs due to loss of „quasi – static‟ assumption and Classical Zero forcing (ZF) receiver produces error floor in Bit erro...

Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers li as parameters such that Zi2"i 5 2". This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within E . The coding speed is comparable to that of conventional coding metho...

In this paper, the problem of coherently extending the integration time for the acquisition of new Global Navigation Satellite System (GNSS) signals is addressed. Unlike the acquisition of legacy GNSS signals, the presence of secondary codes allows the polarity of the transmitted signal to change each primary code period. These polarity changes have to be recovered and symbol combinations have ...

Even the most advanced reverse engineering techniques and products are weak in recovering data structures in stripped binaries—binaries without symbol tables. Unfortunately, forensics and reverse engineering without data structures is exceedingly hard. We present a new solution, known as Howard, to extract data structures from C binaries without any need for symbol tables. Our results are signi...

A blind equalizer attempts to compensate the inter-symbol interference caused by a communication channel without the knowledge of the transmitted sequence. Linear prediction-error lters (PEF) can be used to obtain the equalized symbols. These equalizers are derived assuming a white information sequence. In real communication systems, channel encoding is commonly used to enable the detection and...

Christian Weiß and Jens Berkmann Institute for Communications Engineering (LNT) Munich University of Technology (TUM) e-mail: Christian.Weiss,Jens.Berkmann @ei.tum.de The trellis of a finite abelian group code is locally (i.e., trellis section by trellis section) related to the trellis of the corresponding dual group code. This allows to express the update rules of the BCJR algorithm operating ...

Symbol-pair code is a new coding framework which is proposed to correct errors in the symbolpair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction capability. Employing cyclic and constacyclic codes, we construct three new classes of MDS symbol-pair codes with minimum pairdistance five or six. ...

Increasing interest has been seen in applying power system stabilizer to power systems problems from the number of publications on this topic in recent decade years. As a relatively new research topic a need is felt to pay more attention to the basic principles of the theory, identification of problems and design of Power System Stabilizer. This paper presents a survey of few decade publication...