Smeding, Yolanthe (2022) Decoding cyclic codes using Gröbner bases. Bachelor's Thesis, Mathematics.
|
Text
bMATH_2022_SmedingYP.pdf Download (760kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf Restricted to Registered users only Download (142kB) |
Abstract
In this project, we investigate how the problem of syndrome decoding of cyclic codes can be reduced to solving systems of multivariable polynomial equations using Gr¨obner bases. The first part of the paper focuses on coding and decoding theory for linear codes and how syndrome decoding of cyclic codes can be reduced to solving systems of multivariate polynomial equations. In the second part, we introduce theory on Gr¨obner bases and how they can be useful in solving these systems.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Kilicer, P. and Top, J. |
| Degree programme: | Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 15 Jul 2022 14:02 |
| Last Modified: | 16 Apr 2025 12:59 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/27920 |
Actions (login required)
 |
View Item |