- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Achieving the capacities of channels with erasures...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Achieving the capacities of channels with erasures using nested linear/lattice codes Rahman, Saifur
Abstract
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.
Item Metadata
Title |
Achieving the capacities of channels with erasures using nested linear/lattice codes
|
Creator | |
Supervisor | |
Publisher |
University of British Columbia
|
Date Issued |
2021
|
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.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2021-08-12
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0401395
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2021-09
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NoDerivatives 4.0 International