An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = l/n is given which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence when M 2 T + [nEvu(R)]-’ log, L. The implication that the actual...

Invented in the 1960’s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications. In 2011 a decoding method called LP (linear programming) decoding was introduced for a class of permutation codes with a Euclidean distance induced metric. In this paper we comparatively analyze the Eucl...

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = l/n is given which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence when M 2 T + [nEvu(R)]-’ log, L. The implication that the actual...

In the Shannon lecture at 2019 International Symposium on Information Theory (ISIT), Arikan proposed to employ a one-to-one convolutional transform as pre-coding step before polar transform. The resulting codes of this concatenation are called polarization-adjusted (PAC) . scheme, pair mapper and demapper pre- post- processing devices deployed around memoryless channel, which provides polarized...

We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al who studied the case where the groups are abelian. Moreover, when specialized to the abelian case, our proof is more streamlined and gives a better constant in the exponent of the list size. The constant is improved from ...

In the above paper,1 an asymptotically tight upper bound on the th moment ( 0) of the minimal number of guesses required to determine the value of a random variable was derived. We show that we can tighten this bound for the case of positive integer moments (when = 1, the bound is improved by a factor of 2) and that the new bound also applies to a class of nonminimal guessing sequences.

In this paper we present the results of a method for decoding start codes and overhead information in an MPEG-4 bitstream using sequential decoding with soft channel values. We show that performance of sequential decoding is superior to that of hard decisions alone and can be further improved if probabilities of occurrence of the start codes are taken into consideration.

Measuring brain activity simultaneously from two people interacting is intuitively appealing if one is interested in putative neural markers of social interaction. However, given the complex nature of interactions, it has proven difficult to carry out two-person brain imaging experiments in a methodologically feasible and conceptually relevant way. Only a small number of recent studies have put...