# Multilevel Code Construction for Compound Fading Channels

## TL;DR

This paper presents a method for constructing multi-level lattice codes that can universally approach the capacity of compound block-fading channels with good error performance and manageable decoding complexity.

## Contribution

It introduces explicit, algebraic lattice code constructions for compound fading channels that are constructive, efficient, and approach theoretical capacity limits.

## Key findings

- Codes achieve negligible error probability across channel realizations
- Normalized log-density approaches the Poltyrev limit
- Numerical results demonstrate effective finite-dimensional multi-level lattice codes

## Abstract

We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with negligible probability of error for any channel realization and normalized log-density approaching the Poltyrev limit. Capacity analyses and numerical results on the achievable rates for each partition level are provided. The proposed codes have several enjoyable properties such as constructiveness and good decoding complexity, as compared to random one-level codes. Numerical results for finite-dimensional multi-level lattices based on polar codes are exhibited.