Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Avkodning av cykliska koder - baserad på Euklides algoritm
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
2017 (Swedish)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Decoding of cyclic codes - based on Euclidean algorithm (English)
Abstract [en]

Today’s society requires that transformation of information is done effectively and correctly. In other words, the received message must correspond to the message being sent. There are a lot of decoding methods to locate and correct errors. The main purpose in this degree project is to study one of these methods based on the Euclidean algorithm. Thereafter an example will be illustrated showing how the method is used when decoding a three - error correcting BCH code. To begin with, fundamental concepts about coding theory are introduced. Secondly, linear codes, cyclic codes and BCH codes - in that specific order - are explained before advancing to the decoding process. The results show that correcting one or two errors is relatively simple, but when three or more errors occur it becomes much more complicated. In that case, a specific method is required.

Abstract [sv]

Dagens samhälle kräver att informationsöverföring sker på ett effektivt och korrekt sätt, det vill säga att den information som når mottagaren motsvarar den som skickades från början. Det finns många avkodningsmetoder för att lokalisera och rätta fel. Syftet i denna uppsats är att studera en av dessa, en som baseras på Euklides algoritm och därefter illustrera ett exempel på hur metoden används vid avkodning av en tre - rättande BCH - kod. Först ges en presentation av grunderna inom kodningsteorin. Sedan introduceras linjära koder, cykliska koder och BCH - koder i nämnd ordning, för att till sist presentera avkodningsprocessen. Det visar sig att det är relativt enkelt att rätta ett eller två fel, men när tre eller fler fel uppstår blir det betydligt mer komplicerat. Då krävs någon speciell metod.

Place, publisher, year, edition, pages
2017. , p. 33
Keywords [en]
code word, parity check matrix, generator matrix, syndrome, BCH - code, field extension, Euclidean algorithm method, error locating polynomial
Keywords [sv]
kodord, paritetskontrollmatris, generatormatris, syndrom, BCH - kod, kroppsutvidgning, Euklides algoritm - metoden, felsökningspolynom
National Category
Natural Sciences Mathematics
Identifiers
URN: urn:nbn:se:kau:diva-48248OAI: oai:DiVA.org:kau-48248DiVA, id: diva2:1086731
Subject / course
Mathematics
Educational program
Mathematics Programme (180 ECTS credits)
Presentation
2017-01-11, 21E 205 Karlstad universitet, Karlstad Universitetsgatan 2, 651 88, Karlstad, 14:15 (Swedish)
Supervisors
Examiners
Available from: 2018-10-17 Created: 2017-04-03 Last updated: 2018-11-20Bibliographically approved

Open Access in DiVA

fulltext(563 kB)31 downloads
File information
File name FULLTEXT01.pdfFile size 563 kBChecksum SHA-512
518b895e908eee6bb8ad0e9b2e9d5fbca8f959575dbc24a63de0e02a8eeb899483fc13b91acd861584f8941aa5ad10b4fc2f2e40bae7e9cd4f1a39a0bd56098c
Type fulltextMimetype application/pdf
Arkivfil(536 kB)9 downloads
File information
File name FULLTEXT02.pdfFile size 536 kBChecksum SHA-512
c4a09ee3e8ae19f1af2556c6889708708cc5dd29404597d4ce11b485858c4f023c8e657de05384431caddc3fb1110b6cdcc83f2ed4b0e0ef3fcceb47088aef16
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics and Computer Science (from 2013)
Natural SciencesMathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 40 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 101 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf