Open Access
2015 A Multivariate Weight Enumerator for Tail-biting Trellis Pseudocodewords
Nigel Boston
J. Gen. Lie Theory Appl. 9(S1): 1-4 (2015). DOI: 10.4172/1736-4337.S1-004


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.


Download Citation

Nigel Boston. "A Multivariate Weight Enumerator for Tail-biting Trellis Pseudocodewords." J. Gen. Lie Theory Appl. 9 (S1) 1 - 4, 2015.


Published: 2015
First available in Project Euclid: 11 November 2016

zbMATH: 1371.94672
MathSciNet: MR3637848
Digital Object Identifier: 10.4172/1736-4337.S1-004

Keywords: Binary golay code , invariant theory , Pseudocodewords , Tail-biting trellis , Weight enumerators

Rights: Copyright © 2015 Ashdin Publishing (2009-2013) / OMICS International (2014-2016)

Vol.9 • No. S1 • 2015
Back to Top