A multivariate weight enumerator for tail-biting trellis pseudocodewords

DOI10.4172/1736-4337.S1-004zbMATH Open1371.94672OpenAlexW2274839084MaRDI QIDQ501756FDOQ501756

Authors: Nigel Boston 

Publication date: 10 January 2017

Published in: Journal of Generalized Lie Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jglta/1478833223

Recommendations

• Generalized Hamming weights and trellis complexity
• Trellis complexity and pseudoredundancy of relative two-weight codes
• On the Algebraic Structure of Linear Tail-Biting Trellises
• Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
• Characteristic Generators and Dualization for Tail-Biting Trellises
• scientific article; zbMATH DE number 7558354
• Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
• scientific article; zbMATH DE number 2154131
• Shadow codes and weight enumerators

zbMATH Keywords

invariant theoryweight enumeratorsbinary Golay codepseudocodewordstail-biting trellis

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (2)

• \(M_{24}\)-orbits of octad triples
• Title not available (Why is that?)

This page was built for publication: A multivariate weight enumerator for tail-biting trellis pseudocodewords

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501756)