Sökning: "Hamming codes"
Visar resultat 1 - 5 av 11 uppsatser innehållade orden Hamming codes.
1. Improving Dependability of Space-Cloud Payload Processor by Storage System
Master-uppsats, Mälardalens universitet/Akademin för innovation, design och teknikSammanfattning : Due to the usage of complicated platforms and current high-performance space computing technology, onboard processing in small satellites is expanding. Space-cloud payload processors with Commercial Off-The-Shelf (COTS) components, that are required to be radiation-tolerant, are used to perform the onboard processing. LÄS MER
2. A dynamically adaptive Bluetooth system : Improving the range of Bluetooth classic 4.2 using Forward Error Correction
Kandidat-uppsats, Jönköping University/JTH, Avdelningen för datateknik och informatikSammanfattning : Wireless technology has increased in popularity since its invention, being embedded in many devices, such as smartphones, laptops, earphones etcetera. One of those technologies is Bluetooth, which is a short-range technology that is widely used worldwide. LÄS MER
3. Coding and Decoding of Reed-Muller Codes
Kandidat-uppsats, Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)Sammanfattning : In this thesis some families of linear error correcting codes are presented. The reader will find a general description of binary codes and more specific details about linear codes such as Hamming, repetition codes, Reed-Muller codes, etc. LÄS MER
4. Software based memory correction for a miniature satellite in low-Earth orbit
Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : The harsh radiation environment of space is known to cause bit flips in computer memory. The conventional way to combat this is through error detection and correction (EDAC) circuitry, but for low-budget space missions software EDAC can be used. LÄS MER
5. Nonexistence Theorems for Perfect Codes over Finite Fields
Kandidat-uppsats, Lunds universitet/Matematik (naturvetenskapliga fakulteten)Sammanfattning : In this survey, we consider the trivial perfect codes which are the binary repetition codes of odd length and all codes that only contain one code word. We also take into acount, the Hamming codes as well as the two perfect Golay codes. LÄS MER