Multistage Compute-and-Forward with Multilevel Lattice Codes Based on Product Constructions Conference Paper

abstract

• Product construction with two levels proposed in [1] is a lattice construction which can be thought of as Construction A with codes that can be represented as the Cartesian product of two linear codes. This paper first generalizes the product construction to arbitrary number of levels. More importantly, the existence of a sequence of such lattices that are good for quantization and Poltyrev-good under multistage decoding is proved. This family of lattices is then used to generate a sequence of nested lattice codes based on the recent construction of Ordentlich and Erez. This allows one to achieve the same computation rate of Nazer and Gastpar for compute-and-forward with multistage decoding, which is termed multistage compute-and-forward. 2014 IEEE.

name of conference

• 2014 IEEE International Symposium on Information Theory

authors

• Narayanan, Krishna

published proceedings

• 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)

author list (cited authors)

• Huang, Y., & Narayanan, K. R.

citation count

• 16

complete list of authors

• Huang, Yu-Chih||Narayanan, Krishna R

publication date

• June 2014

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

keywords

• 46 Information And Computing Sciences
• 4613 Theory Of Computation
• 49 Mathematical Sciences
• 4904 Pure Mathematics

Digital Object Identifier (DOI)

• 10.1109/isit.2014.6875206

International Standard Book Number (ISBN) 13

• 9781479951864

start page

• 2112

end page

• 2116

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fisit.2014.6875206