Language: | Slovenian |
---|---|
Year of publishing: | 2013 |
Typology: | 2.11 - Undergraduate Thesis |
Organization: | UM FNM - Faculty of Natural Sciences and Mathematics |
Publisher: | [V. Frajzman] |
UDC: | 51(043.2) |
COBISS: | 20076040 |
Views: | 1054 |
Downloads: | 93 |
Average score: | 0 (0 votes) |
Metadata: |
Secondary language: | English |
---|---|
Secondary title: | VECTOR SPACES OF LINEAR CODES |
Secondary abstract: | Error Correcting Codes help us with correcting errors in transmission or storage of data. Usually the code is in a binary format. It consists of a sequence of 0 and 1. Since the codes were not accurate enough, each message got an extra bit. We live in the age of technology, where the codes correcting errors play an important role. Using the parity bit in the error detection mechanism is one of the most simple and well-known schemes in computer science. We are talking about the Hamming codes and linear codes when we are correcting errors. The Hamming distance and Hamming weight prove to be an important concept with the Hamming codes. Algebraic structure of linear codes provides a framework for efficient algorithms for encoding and decoding. Most current codes for error correction belong to the subgroup of linear codes. |
Secondary keywords: | theses;vectors;linear codes;matrixs;partiy matrix;Hamming codes; |
URN: | URN:SI:UM: |
Type (COBISS): | Undergraduate thesis |
Thesis comment: | Univ. v Mariboru, Fak. za naravoslovje in matematiko, Oddelek za matematiko in računalništvo |
Pages: | 42 f. |
ID: | 8725806 |