Back to results
University of Illinois at Urbana-Champaign
An Improvement to Generalized - Minimum - Distance Decoding
Abstract
dc:descriptionThe generalized-minimum-distance decoding algorithm developed by Forney combined an efficient method of finding candidate codewords with an acceptance criterion. If a codeword meets the acceptance criterion, then it is known to have smaller generalized distance than any other element of the code. Although this condition is sufficient, it is not necessary. It is possible that all codewords fail to satisfy the condition even if there is a unique codeword with smallest generalized distance.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Electrical Engineering
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Taipale, Dana John
- Contributors dc:contributor
-
- Pursley, Michael B.
Subjects
dc:subject × 1Identifiers
dc:identifier.*- Identifier
- (UMI)AAI8803217
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/69382