Trellis complexity and minimal trellis diagrams of lattices

DOI10.1109/18.705562MaRDI QIDQ4701160zbMATH OpenOpenAlexFDO

Authors Amir H. Banihashemi, Ian 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

Korkin-Zolotarev reduced basislatticesminimal trellissuccessive minimatrellis complexitytrellis decoding

Mathematics Subject Classification ID

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

Recommendations

• On the trellis complexity of root lattices and their duals
• Upper bounds on trellis complexity of lattices
• Trellis complexity versus the coding gain of lattices. I

Cited in

(12)

• Optimum commutative group codes
• List-decoding Barnes-Wall lattices
• Scalable revocable identity-based signature over lattices in the standard model
• Trellis complexity versus the coding gain of lattices. I
• Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
• Computing Gröbner bases associated with lattices
• Some combinatorial and recurrence relations for shapes in a trellis
• scientific article; zbMATH DE number 4106925 (Why is no real title available?)
• Upper bounds on trellis complexity of lattices
• On the trellis complexity of root lattices and their duals
• Density/length profiles and trellis complexity of lattices
• Successive minimization of the state complexity of the self-dual lattices using Korkin-Zolotarev reduced basis

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

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