On the trellis complexity of root lattices and their duals

DOI10.1109/18.782169zbMath0959.94023OpenAlexW2103238737MaRDI QIDQ4503368

Amir H. Banihashemi, Ian F. Blake

Publication date: 7 September 2000

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

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

zbMATH Keywords

trellis complexitycomplexity boundsroot latticesminimal trellisestrellis construction

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Relations with coding theory (11H71)

Related Items (3)

Scalable revocable identity-based signature over lattices in the standard model ⋮ Commutative group codes in \(\mathbb R^4\), \(\mathbb R^6\), \(\mathbb R^8\) and \(\mathbb R^{16}\)-approaching the bound ⋮ Optimum commutative group codes

This page was built for publication: On the trellis complexity of root lattices and their duals