Sökning: "Hamming code"
Visar resultat 1 - 5 av 8 uppsatser innehållade orden Hamming code.
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. FPGA Implementation of Feature Matching in ORB-SLAM2
Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknikSammanfattning : Simultaneous Localization And Mapping (SLAM) is an important component in solving the problem of autonomous navigation — allowing machines such as selfdriving cars and mobile robots to find their way in the world without human instruction. Though there is a steadily growing body of literature in the field of SLAM, far fewer works currently address using hardware acceleration to speed up this computationally heavy task. LÄS MER
3. 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
4. Classification of Perfect codes in Hamming Metric
Master-uppsats, Institutionen för datavetenskap, fysik och matematik, DFMSammanfattning : The study of coding theory aims to detect and correct the errors during the transmission of the data. It enhances the quality of data transmission and provides better control over the noisy channels.The perfect codes are collected and analyzed in the premises of the Hamming metric. LÄS MER
5. Classification of perfect codes and minimal distances in the Lee metric
Master-uppsats, Institutionen för datavetenskap, fysik och matematik, DFMSammanfattning : Perfect codes and minimal distance of a code have great importance in the study of theoryof codes. The perfect codes are classified generally and in particular for the Lee metric.However, there are very few perfect codes in the Lee metric. The Lee metric hasnice properties because of its definition over the ring of integers residue modulo q. LÄS MER