Decoding Algorithms for Sparse Network Coding and Their Implementation
Author
Sørensen, Chres Wiant
Term
4. term
Education
Publication year
2013
Submitted on
2013-06-06
Pages
45
Abstract
Efterhånden som mobile enheder kører mere avancerede apps, stiller de større krav til netværksteknologier. En af disse teknologier er Network Coding (NC), som gør det muligt at sende kodede pakker, der er lineære kombinationer af de oprindelige datapakker—altså at blande pakker ved hjælp af simpel algebra. Det giver flere fordele, men øger også kompleksiteten, fordi både afsender og modtager skal kode og afkode data. Dette speciale undersøger, hvordan kompleksiteten kan reduceres ved at udvikle nye afkodningsalgoritmer, og hvordan de kan designes og implementeres, med særligt fokus på sparse koder (koder hvor de fleste elementer er nul).
As mobile devices run more advanced apps, they put increasing demands on network technologies. One such technology is Network Coding (NC), which allows devices to send coded packets that are linear combinations of the original data packets—essentially mixing packets using simple algebra. This offers several benefits, but also adds complexity because both the sender and the receiver must encode and decode the data. This thesis examines how to reduce that complexity by creating new decoding algorithms, and how to design and implement them, with a particular focus on sparse codes (codes where most elements are zero).
[This abstract was generated with the help of AI]
Keywords
Documents