Scholars Central

Research articlePublished 2015

A Multivariate Weight Enumerator for Tail-biting Trellis Pseudocodewords

Authors: Nigel Boston

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Generalized Lie Theory and Applications.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Generalized Lie Theory and Applications
  • SubjectObesity & Weight Management
  • BylineArticles whose byline prints “Nigel Boston”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels