Decoding Methods for Linear Codes Public Deposited

http://ir.library.oregonstate.edu/concern/undergraduate_thesis_or_projects/wd375z00n

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • It is necessary to encode data when transmitting over a noisy channel in order for errors to be detected and corrected. List decoding algorithms provide all code words within a specified distance of a received word in order to be sufficiently robust for cases when two or more code words are equidistant from a received word. This paper details a probabilistic method to obtain multiple close code words, motivated by list decoding methods, for linear codes over fields of two or three elements. It employs a variation on the LLL-Algorithm for lattice reduction that allows the LLL-Algorithm to determine small elements in a vector space. Although it fails to return all code words within a specified distance of a received word, the method is sufficiently robust to provide some information if a received word is equidistant to multiple code words.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Grantor
Advisor
Committee Member
Non-Academic Affiliation
Keyword
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2008-06-19T16:01:44Z (GMT). No. of bitstreams: 1 Barrese Thesis.pdf: 155733 bytes, checksum: 65c0359348c2090b35be48cb859dab63 (MD5)
  • description.provenance : Submitted by Heather Boren (borenh) on 2008-06-18T22:52:28Z No. of bitstreams: 1 Barrese Thesis.pdf: 155733 bytes, checksum: 65c0359348c2090b35be48cb859dab63 (MD5)

Relationships

In Administrative Set:
Last modified: 07/27/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items