In this paper, we propose a method for enhancing performance of a sequential version of the belief-propagation (BP) decoding algorithm, the group shuffled BP decoding algorithm for low-density paritycheck (LDPC) codes. An improved BP decoding algorithm, called the shuffled BP decoding algorithm, decodes each symbol node in serial at each iteration. To reduce the decoding delay of the shuffled B...

Let K/F and K/L be two cyclic Galois field extensions and D = (K/F, σ, c) a cyclic algebra. Given an invertible element d ∈ D, we present three families of unital nonassociative algebras over L ∩ F defined on the direct sum of n copies of D. Two of these families appear either explicitly or implicitly in the designs of fast-decodable space-time block codes in papers by Srinath, Rajan, Markin, O...

Variations in rate of speech (ROS) produce variations in both spectral features and word pronunciations that affect automatic speech recognition systems. To deal with these ROS effects, we propose to use a set of parallel rate-specific acoustic and pronunciation models. Rate switching is permitted at word boundaries, to allow within-sentence speech rate variation, which is common in conversatio...

Propose a new cryptographic information concept. It allows :-to create absolutely algorithmic unbreakable ciphers for communication through open digital channels;-to create new code-breaking methods. They will be the most efficient decoding methods to-date, with the help of which any of the existing codes could, in principle, be broken, provided it is not absolutely unbreakable.

The relationship between the transmitted signal and the noiseless received signals in correlatively changing fading channels is modeled as a nonlinear mapping over manifolds of different dimensions. Dimension counting argument claims that the dimensionality of the neighborhood in which this mapping is bijective with probability one is achievable as the degrees of freedom of the system. We call ...

We introduced an application of the decomposition of a group into cosets of a subgroup to the theory of error detecting and correcting codes. The proposed approach is based on the general method for decoding linear codes known as syndrome decoding. Mathematics Subject Classification: 20A05; 20B05; 20B40

The present study investigated the role of early oral language and family risk for dyslexia in the two developmental pathways toward reading comprehension, through word reading and through oral language abilities. The sample contained 237 children (164 at family risk for dyslexia) from the Dutch Dyslexia Program. Longitudinal data were obtained on seven occasions when children were between 4 an...

This study investigates a population decoding paradigm in which the maximum likelihood inference is based on an unfaithful decoding model (UMLI). This is usually the case for neural population decoding because the encoding process of the brain is not exactly known or because a simplified decoding model is preferred for saving computational cost. We consider an unfaithful decoding model that neg...

This letter considers an iterative decoding algorithm for non-binary linear block codes in which erasure and error decoding is performed for input words given by the sums of a hard-decision received sequence and given test patterns. We have proposed a new selection method of test patterns for the iterative decoding algorithm. Simulation results have shown that the decoding algorithm with test p...