✦ LIBER ✦

Tanner graphs for group block codes and lattices: construction and complexity

✍ Scribed by Banihashemi, A.H.; Kschischang, F.R.

Book ID: 114541848
Publisher: IEEE
Year: 2001
Tongue: English
Weight: 327 KB
Volume: 47
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.910592

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multilevel construction of block and tre

Multilevel construction of block and trellis group codes

✍ Garello, R.; Benedetto, S. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 824 KB

Complexity results for identifying codes

Complexity results for identifying codes in planar graphs

✍ David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 514 KB

Some Constructions for Convolutional and

Some Constructions for Convolutional and Block Codes

✍ von Kaenel, Pierre A. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics ⚖ 498 KB

Graph-Theoretical Constructions for Grap

Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications

✍ Gadouleau, M.; Riis, S. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 401 KB

High-Rate and Full-Diversity Space-Time

High-Rate and Full-Diversity Space-Time Block Codes with Low Complexity Partial Interference Cancellation Group Decoding

✍ Long Shi; Wei Zhang; Xiang-Gen Xia 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 246 KB

Z4-Code Constructions for the Niemeier L

Z4-Code Constructions for the Niemeier Lattices and their Embeddings in the Leech Lattice

✍ Masaaki Harada; Masaaki Kitazume 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 121 KB

In this note, we give Z 4 -code constructions of the Niemeier lattices, showing their embedding in the Leech lattice. These yield an alternative proof of a recent result by Dong et al. [5].