Results 41 to 45 of about 86,022 (45)

Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises [PDF]

arXiv, 2006
An algorithm for exact maximum likelihood(ML) decoding on tail-biting trellises is presented, which exhibits very good average case behavior. An approximate variant is proposed, whose simulated performance is observed to be virtually indistinguishable from the exact one at all values of signal to noise ratio, and which effectively performs computations
arxiv  

Algebraic Construction of Tail-Biting Trellises for Linear Block Codes [PDF]

arXiv, 2015
In this paper, we present an algebraic construction of tail-biting trellises. The proposed method is based on the state space expressions, i.e., the state space is the image of the set of information sequences under the associated state matrix. Then combining with the homomorphism theorem, an algebraic trellis construction is obtained.
arxiv  

Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups [PDF]

arXiv, 2007
A definition of atomic codeword for a group code is presented. Some properties of atomic codewords of group codes are investigated. Using these properties, it is shown that every minimal tail-biting trellis for a group code over a finite abelian group can be constructed from its characteristic generators, which extends the work of Koetter and Vardy who
arxiv  

The Relational Quotient Completion [PDF]

arXiv
Taking a quotient roughly means changing the notion of equality on a given object, set or type. In a quantitative setting, equality naturally generalises to a distance, measuring how much elements are similar instead of just stating their equivalence. Hence, quotients can be understood quantitatively as a change of distance.
arxiv  

Biba's trick [PDF]

arXiv
We give another bit of evidence that forcing axioms provide proper framework for rigidity of quotient structures, by improving the OCA lifting theorem proved by the author in late 20th century and greatly simplifying its proof.
arxiv