New trellis codes based on lattices and cosets
From MaRDI portal
Publication:3780997
DOI10.1109/TIT.1987.1057291zbMATH Open0638.94018OpenAlexW2017458912MaRDI QIDQ3780997FDOQ3780997
N. J. A. Sloane, Robert Calderbank
Publication date: 1987
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1987.1057291
Recommendations
Cited In (15)
- Error-trellises for convolutional codes. I: Construction
- Codes based on a trellis cut set transformation. II: Codes for noncoherent detection
- Title not available (Why is that?)
- A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels
- Minimal-energy clusters of hard spheres
- A trellis coding scheme based on signal alphabet splitting
- New 16-PSK group trellis codes
- Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others
- On the optimality of finite constellations from algebraic lattices
- Title not available (Why is that?)
- Coset codes. I. Introduction and geometrical classification
- Coset codes. II. Binary lattices and related codes
- Penny-packing and two-dimensional codes
- The mathematics of modems
- A new description of trellis codes
This page was built for publication: New trellis codes based on lattices and cosets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780997)
