–Random coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for E-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is attainable by each of the three rules, but the expurgated bound is achievable only by maximum-likelihood decoding. Sphere packing bound is obtained by very simple...

New efficient algorithm for maximum likelihood soft-decision decoding of the Leech lattice is presented. The superiority of this decoder with respect to both computational and memory complexities, compared to previously published decoding methods is demonstrated. Gain factors in the range of 2-10 are achieved. The Leech lattice has been recently suggested for practical implementation of block-c...

Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to have at our disposal a fast decoding algorithm to quickly identify and correct errors as soon as they occur. We propose a linear-time maximum likelihood decoder for surface codes over the quantum erasure channel. Thi...

We derive a closed-form expression for the exact pairwise error probability (PEP) of a non-uniform memoryless binary source transmitted over a Rayleigh fading channel using space-time orthogonal block codes and maximum a posteriori (MAP) detection. The expression is easy to evaluate and holds for any signaling scheme. We then use this result to minimize the bit error rate of the binary antipoda...

Modern wireless communication systems demanding high data rate operating in bandwidth deficient world is using Multiple Input Multiple Output (MIMO) antenna arrangement. MIMO arrangement helping achieving high data rates with a technique of special multiplexing saves bandwidth but needs efficient receivers with manageable hardware. The receivers employing linear equalizers or Decision Feedback ...

The parameterized complexity of a number of fundamental problems of linear codes and integer lattices is explored. Concerning codes, the main results are that Maximum Likelihood Decoding and Weight Distribution are hard for W 1] and NP by parametric polynomial-time transformations from the Perfect Code problem in graphs. Concerning lattices, we prove a similar result for the Theta Series proble...

This paper deals with two methods for automatically finding multiple phonetic transcriptions of words, given sample utterances of the words and an inventory of context-dependent subword units. The two approaches investigated are based on an analysis of theN -best phonetic decoding of the available utterances. In the set of transcriptions resulting from theN -best decoding of all the utterances,...