Search

Kode za odpravljanje napak nam pomagajo pri popravkih v motnjah prenosa ali hranjenja podatkov. Ponavadi je koda v binarnem zapisu. Sestavljena je iz zaporedja 0 in 1. Ker so bile kode premalo natancne so dodali vsakemu sporocilu dodaten bit. Živimo v dobi katere bistveno ozadje je tehnologija, zato imajo kode, ki popravljajo napake zelo veliko vlogo. Uporaba paritetnega bita v mehanizmu zaznavanja napak je ena najbolj preprostih in znanih shem v racunalništvu. Pri popravljanju napak govorimo tudi o Hammingovih kodah in linearnih kodah. Pri Hammingovih kodah se izkažeta za pomembna pojma Hammingova razdalja in Hammingova teža. Algebraicna struktura linearnih kod podaja okvir za ucinkovite algoritme za kodiranje in dekodiranje. Večina aktualnih kod za popravljanje napak spada v podskupine linearnih kod. 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.