Answers are grounded in this paper and cite their sources.
Tail-biting-trellis representations of codes allow for iterative decoding algorithms, which are limited in effectiveness by the presence of pseudocodewords. We introduce a multivariate weight enumerator that keeps track of these pseudocodewords. This enumerator is invariant under many linear transformations, often enabling us to compute it exactly. The extended binary Golay code has a particularly nice tail-biting-trellis and a famous unsolved question is to determine its minimal AWGN pseudodistance. The new enumerator provides an inroad to this problem.
No takes yet. Share an insight, caveat, or question.
Nigel Boston (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: