Trellis complexity and minimal trellis diagrams of lattices

DOI10.1109/18.705562zbMath0953.94030OpenAlexW2120641775MaRDI QIDQ4701160

Amir H. Banihashemi, Ian F. Blake

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.705562

zbMATH Keywords

latticessuccessive minimaKorkin-Zolotarev reduced basistrellis complexitytrellis decodingminimal trellis

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12)

Related Items (4)

Computing Gröbner bases associated with lattices ⋮ Scalable revocable identity-based signature over lattices in the standard model ⋮ List-decoding Barnes-Wall lattices ⋮ Optimum commutative group codes

This page was built for publication: Trellis complexity and minimal trellis diagrams of lattices