Open Collections

Achieving channel capacities with nested linear/lattice codes : a unified approach

University of British Columbia

Random nested lattice codes have played an important role in network information theory. However, they are less accessible than conventional random codes because their achievability proofs are often involved, even for the case of the additive white Gaussian noise (AWGN) channel. In sharp contrast, their finite field counterparts, nested linear codes, enjoy much simpler achievability proofs. In this thesis, we make use of an intriguing connection between nested lattice codes and nested linear codes to handle their achievability proofs in a unified approach. As a by-product of this unified approach, we show it’s capable of proving that the algebraic lattice codes constructed using number field could achieve the AWGN channel capacity.

Text

2018-08-14

Attribution-NonCommercial-NoDerivatives 4.0 International

http://hdl.handle.net/2429/66765

Electrical Engineering

University of British Columbia

UBCO

http://creativecommons.org/licenses/by-nc-nd/4.0/