Decoding Methods for Linear Codes

Honors College Thesis

Öffentlich Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/honors_college_theses/wd375z00n

Descriptions

Attribute Name	Values
Creator	Barrese, Kenny
Abstract	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.
License	All rights reserved
Resource Type	Honors College Thesis
Date Available	2008-06-19T16:01:44+00:00
Date Issued	2008-06-04
Degree Level	Bachelor's
Degree Name	Honors Bachelor of Science (H.B.S.) Honors Bachelor of Arts (H.B.A.)
Degree Field	Philosophy Mathematics
Degree Grantor	Oregon State University
Commencement Year	2008
Advisor	Flahive, Mary
Committee Member	Schmidt, Thomas
Non-Academic Affiliation	Oregon State University. Honors College
Urheberrechts-Erklärung	In Copyright
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
Replaces	http://hdl.handle.net/1957/8812

Parents:

This work has no parents.

In Collection:

Miniaturansicht	Titel	Hochladedatum	Sichtbarkeit	Aktionen
	Barrese_Thesis.pdf	2017-07-29	Öffentlich	Herunterladen