An error-trellis is a directed graph that represents all the sequences belonging to the coset which contains the symbolby-symbol detected version of a given received sequence. A modular construction of error-trellises for an (n; k) convolutional code over GF(q) is presented. The trellis is designed on the basis of partitioning the scalar check matrix of the code into submatrices of l rows, acco...

The central hypothesis in the theory of resource-bounded measure 6] is the assertion that NP does not have measure 0 in Exponential Time. This is a quantitative strengthening of the assertion that NP does not equal P. We show that the analog in P of this hypothesis fails dramatically. In fact, we show that nondeterministic time n to the power (1=11) has measure zero in P. These follow as conseq...

Citation STAR Collaboration et al. " Observation of charge-dependent azimuthal correlations and possible local strong parity violation in heavy-ion collisions. " Physical Review C 81.5 (2010): 054908. Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this art...

For an excellent introduction and mathematical treatise of modern iterative decoding theory, we refer to [4]. Worth mentioning is also the survey paper [2] on factor graphs and the sum-product algorithm, the superclass that contains belief propagation. This current technical note provides Matlab code to implement the dynamical system formulation of the belief propagation algorithm and a few rel...

in the restructured environment of electricity market, firstly the generating companies and the customers are looking for maximizing their profit and secondly independent system operator is looking for the stability of the power network and maximizing social welfare. in this paper, a one way auction in the electricity market for the generator companies is considered in both perfect and imperfec...

This is a phenomenological review of R parity violating SUSY models, with particular emphasis on explicit R parity violation.

We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n, k. Among these new codes there is an optimal ternary [88, 8, 54]3 code. We develop an algorithm, which starts with already good codes C , i.e. codes with high minimum distance d for given length n and dimensio...

In this paper, we propose to generalize the coding schemes first proposed by Kozic et al. to high spectral efficient modulation schemes. We study at first Chaos Coded Modulation based on the use of small dimensional modulo-MAP encoding process and we give a solution to study the distance spectrum of such coding schemes to accurately predict their performances. However, the obtained performances...

The n-variable PARITY function is computable (by a well-known recursive construction) by AC formulas of depth d+ 1 and leafsize n·2dn1/d . These formulas are seen to possess a certain symmetry: they are syntactically invariant under the subspace P of even-weight elements in {0, 1}, which acts (as a group) on formulas by toggling negations on input literals. In this paper, we prove a 2 −1) lower...