Matrix theory for minimal trellises

DOI10.1007/s10623-019-00627-8zbMath1421.94092arXiv1509.08376OpenAlexW2258210087WikidataQ128006380 ScholiaQ128006380MaRDI QIDQ2329393

Iwan M. Duursma

Publication date: 17 October 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.08376

zbMATH Keywords

tail-biting trellislinear block codeminimal trellischaracteristic generatorKoetter and Vardy conjecture

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combined modulation schemes (including trellis codes) in coding theory (94B12) Applications of graph theory to circuits and networks (94C15) Direct numerical methods for linear systems and matrix inversion (65F05) Canonical forms, reductions, classification (15A21)

Cites Work

• Unnamed Item
• Unnamed Item
• Distance bounds for algebraic geometric codes
• Delta sets for divisors supported in two points
• The structure of tail-biting trellises: Minimality and basic principles
• Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
• Coset codes. II. Binary lattices and related codes
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
• Minimal tail-biting trellises: the Golay code and more
• On the trellis structure of block codes
• On the BCJR trellis for linear block codes
• Characteristic Generators and Dualization for Tail-Biting Trellises
• Two-Point Coordinate Rings for GK-Curves
• Minimal Realizations of Linear Systems: The “Shortest Basis” Approach
• Linear Tail-Biting Trellises: Characteristic Generators and the BCJR-Construction

This page was built for publication: Matrix theory for minimal trellises