Back to search

University of British Columbia

Achieving the capacities of channels with erasures using nested linear/lattice codes

Abstract

dc:description

Since the breakthrough of Shannon's classical work on information theory there has been exhaustive research on the achievability proofs for the random i.i.d codes. The drawback of such codes is that they admit little or no structure. Practical codes are preferred to be structured, while ensuring reliability. Structured codes, such as linear and lattice codes are such codes of practical interest as they exhibit rich geometric structure. However, the achievable rate achieved by specific structured codes (nested linear and nested lattice codes) in communication channel subjected to erasures has not been studied yet. We address this problem and provide achievability proofs for two common communication channel types, the DMC and AWGN channel with erasure, while using structured codes. We show that nested linear/lattice codes approach the capacities of these channels.

Degree

thesis:*
Name thesis:degree_name
Master of Applied Science - MASc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Electrical Engineering
Grantor dc:publisher
University of British Columbia
Year dc:date
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rahman, Saifur
Contributors dc:contributor
  • Chaaban, Anas

Rights

dc:rights
Statement dc:rights
  • Attribution-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/79278

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Rahman, Saifur. Achieving the capacities of channels with erasures using nested linear/lattice codes. master's thesis, University of British Columbia, 2021. http://hdl.handle.net/2429/79278