A new decoding algorithm for geometrically uniform trellis codes exploiting the group structure of the codes is presented. The algorithm complexity does not depend on the number of states of the trellis describing the code. Performance of the algorithm are evaluated through simulation and its complexity is compared to the Viterbi algorithm
The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Thr...
Block codes are viewed from a formal language theoretic perspective. It is shown that properties of ...
In principle, the coding gain of a digital communications system can be improved through the use of ...
A new decoding algorithm for geometrically uniform trellis codes exploiting the group structure of t...
A new decoding algorithm for geometrically uniform TCM schemes is proposed, based on the group prope...
In this paper, we present a procedure to design maximum likelihood (MIL) decoders for the new class ...
We look at graphical descriptions of block codes known as trellises, which illustrate connections be...
AbstractFor a Viterbi-like algorithm over a sectionalized trellis of a linear block code, the decodi...
For a Viterbi-like algorithm over a sectionalized trellis of a linear block code, the decoding proce...
A new simple decomposable code construction technique, Geometric Augmented Product (GAP), is recentl...
This paper presents two new iterative algorithms for decoding linear codes based on their tail bitin...
We look at graphical descriptions of block codes known as trellises, which illustrate connections be...
Several new algorithms for decoding lattice partitions are presented. They apply to Viterbi decoding...
A new encoding/decoding technique for Hamming codes, based on generalised array codes (GACs) is prop...
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in ...
The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Thr...
Block codes are viewed from a formal language theoretic perspective. It is shown that properties of ...
In principle, the coding gain of a digital communications system can be improved through the use of ...
A new decoding algorithm for geometrically uniform trellis codes exploiting the group structure of t...
A new decoding algorithm for geometrically uniform TCM schemes is proposed, based on the group prope...
In this paper, we present a procedure to design maximum likelihood (MIL) decoders for the new class ...
We look at graphical descriptions of block codes known as trellises, which illustrate connections be...
AbstractFor a Viterbi-like algorithm over a sectionalized trellis of a linear block code, the decodi...
For a Viterbi-like algorithm over a sectionalized trellis of a linear block code, the decoding proce...
A new simple decomposable code construction technique, Geometric Augmented Product (GAP), is recentl...
This paper presents two new iterative algorithms for decoding linear codes based on their tail bitin...
We look at graphical descriptions of block codes known as trellises, which illustrate connections be...
Several new algorithms for decoding lattice partitions are presented. They apply to Viterbi decoding...
A new encoding/decoding technique for Hamming codes, based on generalised array codes (GACs) is prop...
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in ...
The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Thr...
Block codes are viewed from a formal language theoretic perspective. It is shown that properties of ...
In principle, the coding gain of a digital communications system can be improved through the use of ...
DOI
Add to ORKG