# Compute-and-Forward over Block-Fading Channels Using Algebraic Lattices

## TL;DR

This paper explores an advanced compute-and-forward strategy over block-fading channels using algebraic lattices, improving decoding error rates and computation efficiency compared to traditional integer-based methods.

## Contribution

It introduces a novel algebraic lattice approach for compute-and-forward over block-fading channels, surpassing integer-based methods in performance.

## Key findings

- Improved decoding error probabilities
- Higher computation rates
- Outperforms integer-based C ext{F} strategies

## Abstract

Previous approaches to compute-and-forward (C\&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C\&F strategy over block fading channels using Construction A over rings, so as to allow better quantization for the channels. Advantages in decoding error probabilities and computation rates are demonstrated, and the construction is shown to outperform the C\&F strategy over the integers $\mathbb{Z}$.