To see the other types of publications on this topic, follow the link: Hamming codes.
Dissertations / Theses on the topic 'Hamming codes'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 45 dissertations / theses for your research on the topic 'Hamming codes.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Sabir, Tanveer. "Classification of Perfect codes in Hamming Metric." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-13833.
Full textAbstract:
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.This classification yields that there exists only a few perfect codes. The perfect codes do not guarantee the perfection by all means but just satisfy certain bound and properties. The detection and correction of errors is always very important for better data transmission.
2
Muthivhi, Thifhelimbilu Ronald. "Codes Related to and Derived from Hamming Graphs." University of the Western Cape, 2013. http://hdl.handle.net/11394/4091.
Full textAbstract:
Masters of Science<br>Codes Related to and Derived from Hamming Graphs
T.R Muthivhi
M.Sc thesis, Department of Mathematics, University of Western Cape
For integers n; k 1; and k n; the graph k
n has vertices the 2n vectors
of Fn2
and adjacency de ned by two vectors being adjacent if they di er in k
coordinate positions. In particular, 1
n is the classical n-cube, usually denoted
by H1(n; 2): This study examines the codes (both binary and p-ary for p an odd
prime) of the row span of adjacency and incidence matrices of these graphs.
We rst examine codes of the adjacency matrices of the n-cube. These have
been considered in [14]. We then consider codes generated by both incidence
and adjacency matrices of the Hamming graphs H1(n; 3) [12]. We will also
consider codes of the line graphs of the n-cube as in [13].
Further, the automorphism groups of the codes, designs and graphs will be
examined, highlighting where there is an interplay. Where possible, suitable
permutation decoding sets will be given.
3
Harney, Isaiah H. "Colorings of Hamming-Distance Graphs." UKnowledge, 2017. http://uknowledge.uky.edu/math_etds/49.
Full textAbstract:
Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number. A notion of robustness is defined for colorings of these graphs based on the tolerance of swapping colors along an edge without destroying the properness of the coloring, and a complete characterization of the maximally robust colorings is given for certain parameters. Additionally, explorations are made into subgraph structures whose identification may be useful in determining the chromatic number.
4
Mollard, Michel. "Quelques problèmes combinatoires sur l'hypercube et les graphes de Hamming." Habilitation à diriger des recherches, Grenoble 1, 1989. http://tel.archives-ouvertes.fr/tel-00333335.
Full text
5
Puchinger, Sven [Verfasser]. "Construction and decoding of evaluation codes in hamming and rank metric / Sven Puchinger." Ulm : Universität Ulm, 2018. http://d-nb.info/1166757323/34.
Full text
6
Ahmed, Naveed, and Waqas Ahmed. "Classification of perfect codes and minimal distances in the Lee metric." Thesis, Linnaeus University, School of Computer Science, Physics and Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-6574.
Full textAbstract:
<p>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. It isconjectured that there are no perfect codes in this metric for q > 3, where q is a primenumber.The minimal distance comes into play when it comes to detection and correction oferror patterns in a code. A few bounds on the number of codewords and minimal distanceof a code are discussed. Some examples for the codes are constructed and their minimaldistance is calculated. The bounds are illustrated with the help of the results obtained.</p>
7
Faure, Cédric. "Etudes de systèmes cryptographiques construits à l'aide de codes correcteurs, en métrique de Hamming et en métrique rang." Phd thesis, Ecole Polytechnique X, 2009. http://pastel.archives-ouvertes.fr/pastel-00005288.
Full textAbstract:
Cette thèse étudie deux approches différentes visant à réduire la taille de la clé publique des cryptosystèmes à base de codes correcteurs. Une première idée en ce sens est l'utilisation de familles de codes à haute capacité de correction, comme les codes géométriques. Depuis l'attaque de Sidelnikov et Shestakov, on sait qu'un attaquant peut retrouver la structure d'un code de Reed-Solomon utilisé dans la clé publique. Nous avons réussi à adapter aux courbes hyperelliptiques la méthode d'attaque développée par Minder contre les codes elliptiques. Nous sommes notamment en mesure d'attaquer en temps polynomial le système de Janwa et Moreno développé sur des codes géométriques de genre 2 ou plus. Une seconde idée est l'utilisation de codes correcteurs pour la métrique rang. Celle-ci complique énormément les attaques par décodage, qui ne peuvent plus utiliser une fenêtre d'information pour tenter de décoder. On peut ainsi se prémunir des attaques par décodage en utilisant une clé publique de faible taille. Dans cette optique, nous présentons un cryptosystème à clé publique basé sur le problème de reconstruction de polynômes linéaires. Nous montrons que notre système est rapide, utilise des clés de taille raisonnable, et résiste à toutes les attaques connues dans l'état de l'art.
8
Machado, Daniel Alves. "Uma abordagem de dígitos verificadores e códigos corretores no ensino fundamental." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-24112016-103137/.
Full textAbstract:
Este trabalho, elaborado por meio de pesquisa bibliográfica, apresenta um apanhado sobre os dígitos verificadores presentes no Cadastro de Pessoas Físicas (CPF), no código de barras, e no sistema ISBN; faz uma introdução sobre a métrica de Hamming e os códigos corretores de erros; cita a classe de códigos mais utilizada, que são os códigos lineares, e deixa a sugestão de uma proposta pedagógica para professores de matemática aplicarem no Ensino Fundamental, podendo ser ajustada também para o Ensino Médio. No apêndice A, são propostos alguns exercícios que podem ser trabalhados com os alunos em sala de aula.<br>This work, based on the attached references, presents an overview of the check digits that appear in the Brazilian document CPF, in the bar code and the ISBN system. Moreover, it makes an introduction to the Hamming metric and error-correcting codes. In particular, some considerations about linear codes are done and it makes a suggestion of a pedagogical approach to apply it in middle school and can also be adjusted to high school. In the Appendix A are proposed some exercises to students.
9
Lemes, Leandro Cruvinel. "Códigos de Goppa e Distâncias Generalizadas de Hamming." Universidade Federal de Uberlândia, 2009. https://repositorio.ufu.br/handle/123456789/16775.
Full textAbstract:
Fundação de Amparo a Pesquisa do Estado de Minas Gerais<br>In this work, we study geometric Goppa codes and present several results on the so-called
generalized Hamming distances. In the particular case of Hermitian codes we present precise
results for the first, second and third generalized distances, for almost all Goppa codes supported
on one point.<br>Neste trabalho estudamos códigos de Goppa e apresentamos diversos resultados sobre as assim
chamadas distâncias generalizadas de Hamming. No caso particular de códigos Hermitianos,
apresentamos resultados exatos para a primeira, segunda e terceira distâncias generalizadas de
Hamming, considerando quase todos os códigos suportados em um ponto.<br>Mestre em Matemática
10
Ávila, Dane Marques de. "O segundo peso de Hamming do código de Reed-Muller generalizado." Universidade Federal de Uberlândia, 2016. https://repositorio.ufu.br/handle/123456789/16822.
Full textAbstract:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>In this work we present the determination of the second Hamming weight of generalized Reed-
Muller codes in most cases (see Teorema 4.6). Our main reference is [13], although we have
also used results from [3] and [5]. In the first chapter we describe finite fields e we show how
they can be constructed. In chapter 2 we present the basics of coding theory. We define what
are error correcting codes, the Hamming metric, the parameters of a code, the equivalence of
codes through the concept of isometry, and we briefly present generalized Reed-Muller codes
and their parameters. In chapter 3 we present some results from Grobner bases theory and
the definition of Affine Cartesian codes, which generalize the generalized Reed-Muller codes. we
use tools from Grobner bases theory to determine the dimension and the minimum distance of
Affine Cartesian codes. We finish our work in chapter 4, with the determination of the second
Hamming weight for generalized Reed-Muller codes in most cases.<br>Nesse trabalho apresentamos o cálculo do segundo peso de Hamming de códigos de Reed-Muller
generalizados na maioria dos casos (v. Teorema 4.6). Nossa referência principal sera [13],
embora tenhamos utilizado também resultados de [3] e [5]. No primeiro capítulo descrevemos
os corpos finitos e mostramos como podem ser construídos. No capítulo 2 apresentamos os
conceitos básicos da teoria de códigos. Nele, definimos o que são os códigos corretores de erros,
a métrica de Hamming, os parâmetros de um código, a equivalência de códigos através da noção
de isometria, bem como uma breve apresentação dos códigos de Reed-Muller generalizados e
seus parâmetros. No capítulo 3 sao apresentados alguns resultados da teoria de Bases de
Grobner e a definição dos Códigos Cartesianos Afins, que são uma generalização dos códigos de
Reed-Muller generalizados. Usamos ferramentas da teoria de bases de Grobner para determinar
a dimensão e distância mínima de Códigos Cartesianos Afins. Para finalizar nosso trabalho, no
capítulo 4 determinamos o segundo peso de Hamming do Código de Reed-Muller generalizado
na maioria dos casos.<br>Mestre em Matemática
11
Khalil, Maya. "Classes de Steinitz, codes cycliques de Hamming et classes galoisiennes réalisables d'extensions non abéliennes de degré p³." Thesis, Valenciennes, 2016. http://www.theses.fr/2016VALE0012/document.
Full text
12
Reimers, Stephen Paul. "Towards Internet Protocol over seawater (IP/SW) : forward error correction (FEC) using Hamming codes for reliable acoustic telemetry /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1995. http://handle.dtic.mil/100.2/ADA306010.
Full text
13
Bogaerts, Mathieu. "Codes et tableaux de permutations, construction, énumération et automorphismes." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210302.
Full textAbstract:
<p>Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entre deux éléments de C est supérieure ou égale à d. Dans cette thèse, le groupe des isométries de (Sym(n),D) est déterminé et il est prouvé que ces isométries sont des automorphismes du schéma d'association induit sur Sym(n) par ses classes de conjugaison. Ceci mène, par programmation linéaire, à de nouveaux majorants de la taille maximale des G(n,d) pour n et d fixés et n compris entre 11 et 13. Des algorithmes de génération avec rejet d'objets isomorphes sont développés. Pour classer les G(n,d) non isométriques, des invariants ont été construits et leur efficacité étudiée. Tous les G(4,3) et les G(5,4) ont été engendrés à une isométrie près, il y en a respectivement 61 et 9445 (dont 139 sont maximaux et décrits explicitement). D’autres classes de G(n,d) sont étudiées.<p><p><p><p> <p><p><p><p>A permutation code G(n,d) is a subset C of Sym(n) such that the Hamming distance D between two elements of C is larger than or equal to d. In this thesis, we characterize the isometry group of the metric space (Sym(n),D) and we prove that these isometries are automorphisms of the association scheme induced on Sym(n) by the conjugacy classes. This leads, by linear programming, to new upper bounds for the maximal size of G(n,d) codes for n and d fixed and n between 11 and 13. We develop generating algorithms with rejection of isomorphic objects. In order to classify the G(n,d) codes up to isometry, we construct invariants and study their efficiency. We generate all G(4,3) and G(4,5)codes up to isometry; there are respectively 61 and 9445 of them. Precisely 139 out of the latter codes are maximal and explicitly described. We also study other classes of G(n,d)codes.<p><p><p><p><br>Doctorat en sciences, Spécialisation mathématiques<br>info:eu-repo/semantics/nonPublished
14
Schrek, Julien. "Signatures et authentications pour les cryptosystèmes bases sur les codes correcteurs en métrique de Hamming et en métrique rang." Limoges, 2013. http://aurore.unilim.fr/theses/nxfile/default/e9fa83b6-8739-4c8a-8bd2-90c729b9a03f/blobholder:0/2013LIMO4052.pdf.
Full textAbstract:
Cette thèse est constituée de 13 chapitres. Les 8 premiers forment la première partie et les 5 suivants forment la deuxième partie. Cette thèse traite des signatures et authentifications basées sur les codes correcteurs en métrique de Hamming et en métrique rang. La première partie regroupe les résultats obtenus en métrique de Hamming et la deuxième partie ceux obtenus en métrique rang. Dans la première partie nous présentons quatre nouvelles signatures basées sur les codes correcteurs. La première est une signature basée sur un protocole zéro-knowledge et a la particularité d'avoir une taille plus petite que les signatures construites de cette façon. La deuxième signature a une taille très petite mais n'est utilisable qu'une seule fois. Elle utilise les codes correcteurs très structurés de résidus quadratiques. La troisième signature est une signature d'anneau à seuil. Elle permet à un groupe de personnes de signer en cachant son identité parmi un groupe de personnes plus important. La quatrième signature est une signature indéniable. Elle permet de contrôler la vérification de la signature à l'aide d'un protocole interactif. La vérification ne doit pas permettre à l'auteur de tricher sur le fait qu'il ait ou non signé la signature. La deuxième partie cerne la métrique rang. Nous y présentons une nouvelle attaque générique sur le problème de décodage par syndrome. Deux attaques spécifiques sur le cryptosystèmes de K. Chen qui le cassent complétement. Nous y présentons aussi une nouvelle signature qui a une petite taille ainsi que de petites tailles de clés comparée aux autres signatures en métrique rang<br>This thesis consists of 13 chapters. The first 8 are the first part and the following five form the second part. This thesis is about signatures and authentifications based on coding theory for Hamming metric and rank metric and the second part, those obtained on rank metric. In first part, we present four new signatures based on coding theory. The first signature is a signature based on a zero-knowledge protocol and has the distinction of having a size smaller than the signatures built this way. The second signature is a very small but can be used only one time. It uses the highly structured codes of quadratic residues. The third signature is a ring threshold signature. It allows a group of people to sign hiding his identity from a larger group. The fourth is a signature undeniable. It controls the signature verification using an interactive protocol. The verification must not allow the author to cheat on the fact that it is or not the signer. The second part identifies the metric rank. We present a new generic attack on the syndrom decoding problem, more efficient than the previous ones. Two specific attacks on the cryptosystem K. Chen that completely breaks it. We also present a new signature that has a small size and small key sizes compare to other signatures in rank metric
15
Bekjarova, Milka. "Packet erasure correcting codes for wireless sensor networks: implementation and field trial measurements." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/3558/.
Full textAbstract:
This thesis regards the Wireless Sensor Network (WSN), as one of the most important technologies for the twenty-first century and the implementation of different packet correcting erasure codes to cope with the ”bursty” nature of the transmission channel and the possibility of packet losses during the transmission. The limited battery capacity of each sensor node makes the minimization of the power consumption one of the primary concerns in WSN. Considering also the fact that in each sensor node the communication is considerably more expensive than computation, this motivates the core idea to invest computation within the network whenever possible to safe on communication costs. The goal of the research was to evaluate a parameter, for example the Packet Erasure Ratio (PER), that permit to verify the functionality and the behavior of the created network, validate the theoretical expectations and evaluate the convenience of introducing the recovery packet techniques using different types of packet erasure codes in different types of networks. Thus, considering all the constrains of energy consumption in WSN, the topic of this thesis is to try to minimize it by introducing encoding/decoding algorithms in the transmission chain in order to prevent the retransmission of the erased packets through the Packet Erasure Channel and save the energy used for each retransmitted packet. In this way it is possible extend the lifetime of entire network.
16
Dyshko, Serhii. "Généralisations du Théorème d'Extension de MacWilliams." Thesis, Toulon, 2016. http://www.theses.fr/2016TOUL0018/document.
Full textAbstract:
Le fameux Théorème d’Extension de MacWilliams affirme que, pour les codes classiques, toute isométrie deHamming linéaire d'un code linéaire se prolonge en une application monomiale. Cependant, pour les codeslinéaires sur les alphabets de module, l'existence d'un analogue du théorème d'extension n'est pas garantie.Autrement dit, il existe des codes linéaires sur certains alphabets de module dont les isométries de Hammingne sont pas toujours extensibles. Il en est de même pour un contexte plus général d'un alphabet de module munid'une fonction de poids arbitraire. Dans la présente thèse, nous prouvons des analogues du théorèmed'extension pour des codes construits sur des alphabets et fonctions de poids arbitraires. La propriétéd'extension est analysée notamment pour les codes de petite longueur sur un alphabet de module de matrices,les codes MDS généraux, ou encore les codes sur un alphabet de module muni de la composition de poidssymétrisée. Indépendamment de ce sujet, une classification des deux groupes des isométries des codescombinatoires est donnée. Les techniques développées dans la thèse sont prolongées aux cas des codesstabilisateurs quantiques et aux codes de Gabidulin dans le cadre de la métrique rang<br>The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometry ofa linear code extends to a monomial map. However, for linear codes over module alphabets an analogue of theextension theorem does not always exist. That is, there may exists a linear code over a module alphabet with anunextendable Hamming isometry. The same holds in a more general context of a module alphabet equippedwith a general weight function. Analogues of the extension theorem for different classes of codes, alphabetsand weights are proven in the present thesis. For instance, extension properties of the following codes arestudied: short codes over a matrix module alphabet, maximum distance separable codes, codes over a modulealphabet equipped with the symmetrized weight composition. As a separate result, a classification of twoisometry groups of combinatorial codes is given. The thesis also contains applications of the developedtechniques to quantum stabilizer codes and Gabidulin codes
17
Závorka, Radek. "Program pro demonstraci kanálového kódování." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-413009.
Full textAbstract:
The main subject of this thesis is creating a programme, used for channel coding demonstration. This programme will be used for teaching purposes. The programme contains various codes from simple ones, to those which almost reach Shanon’s channel capacity theorem. Specifically these are the Hamming code, cyclic code, convolutional code and LDPC code. These functions are based on theoretical background described in this thesis and have been programed in Matlab. Practical output of this thesis is user interface, where the user is able to input information word, simulate transmission through the transmission channel and observe coding and decoding for each code. This thesis also contains a comparison between individual codes, concerning bit-error rate depending on SNR and various parameters. There is a computer lab with theoretical background, assignment and sheets for convenient accomplishment of each task.
18
Dahlberg, Johan. "Embedded Computer for Space Applications suitable for Linux." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2085.
Full textAbstract:
<p>This report briefly describes the special requirements for a computer board for use in space. In particular, component selection and ways of mitigating the soft and hard errors are discussed. Furthermore, one implementation for a low-cost, relatively high performance computer that will work in the harsh space environment is presented. The report is primarily intended for those familiar with digital design, who need an introduction to construction of space or other high-reliability hardware. </p><p>As the quality (resolution) of imagers, spectrometers and other data sources in scientific satellite payloads is increasing, there is also an increasing demand for more processing power in order to compress or in other way process the data before transmitting it on the limited bandwidth microwave downlink to Earth. Scientific instruments are usually mission specific and have rather low budget, so there is a need for a powerful computer board that can be used for a number of missions in order to keep the engineering costs down.</p>
19
Lemes, Leandro Cruvinel 1985. "Novos limitantes para a probabilidade de erro de decodificação em canais com apagamento." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/305913.
Full textAbstract:
Orientador: Marcelo Firer<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica<br>Made available in DSpace on 2018-08-23T13:47:51Z (GMT). No. of bitstreams: 1
Lemes_LeandroCruvinel_D.pdf: 1250342 bytes, checksum: e1a6a639b2a96ae11f0c70d7507040aa (MD5)
Previous issue date: 2013<br>Resumo: Considerando canais discretos, sem memória e com apagamento, obtemos limitantes superiores e inferiores para as probabilidades de erro de decodificação e de ocorrências de ambiguidade de códigos corretores de erro lineares. Os limitantes dependem da hierarquia de pesos e dos espectros generalizados e melhoram os limitantes conhecidos. Encontramos expressões exatas para essas probabilidades nos casos em que o código é AMDS ou MDS<br>Abstract: Considering an erasure channel, we improve upper and lower bounds for error decoding and ambiguity probabilities of linear error-correcting codes. The given bounds depend on the generalized weight hierarchy and spectrum of a code. We find explicit formulae in the case of AMDS and MDS codes<br>Doutorado<br>Matematica<br>Doutor em Matemática
20
Kostrhoun, Jan. "Protichybové zabezpečení v digitálních komunikačních systémech." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-220327.
Full textAbstract:
This work deals with forward error correction. In the work, basic methods and algorithms of error correction are described. For the presentation of encoding and decoding process of Hamming code, Reed-Müller code, Fire code, Reed-Solomon code and Trellis coded modulation programs in Matlab were created.
21
Pacher, Jakub. "Protichybové systémy s prokládáním." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218329.
Full textAbstract:
This work involves in anti-error coding systems with interleaving. At first is given summary of high-frequency use error correction codes. Below there are described two basic techniques of interleaving and their confrontation. The next text is focusing on survey and characteristics of codes which conform to submission. After selection of optimal system is verified its function in MATLAB environment. Final step is creation of functional application in C++ environment. This application serves to transmission of error correction BMP pictures.
22
Karaer, Arzu. "Optimum bit-by-bit power allocation for minimum distortion transmission." Texas A&M University, 2005. http://hdl.handle.net/1969.1/4760.
Full textAbstract:
In this thesis, bit-by-bit power allocation in order to minimize mean-squared error (MSE) distortion of a basic communication system is studied. This communication system consists of a quantizer. There may or may not be a channel encoder and a Binary Phase Shift Keying (BPSK) modulator. In the quantizer, natural binary mapping is made. First, the case where there is no channel coding is considered. In the uncoded case, hard decision decoding is done at the receiver. It is seen that errors that occur in the more significant information bits contribute more to the distortion than less significant bits. For the uncoded case, the optimum power profile for each bit is determined analytically and through computer-based optimization methods like differential evolution. For low signal-to-noise ratio (SNR), the less significant bits are allocated negligible power compared to the more significant bits. For high SNRs, it is seen that the optimum bit-by-bit power allocation gives constant MSE gain in dB over the uniform power allocation. Second, the coded case is considered. Linear block codes like (3,2), (4,3) and (5,4) single parity check codes and (7,4) Hamming codes are used and soft-decision decoding is done at the receiver. Approximate expressions for the MSE are considered in order to find a near-optimum power profile for the coded case. The optimization is done through a computer-based optimization method (differential evolution). For a simple code like (7,4) Hamming code simulations show
that up to 3 dB MSE gain can be obtained by changing the power allocation on the
information and parity bits. A systematic method to find the power profile for linear block codes is also introduced given the knowledge of input-output weight enumerating function of the code. The information bits have the same power, and parity bits
have the same power, and the two power levels can be different.
23
Pospíšil, Jakub. "Bezdrátová čidla pro měření hladiny vody." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218270.
Full textAbstract:
The thesis deals with both scheme and its implementation of water-level metering apparatus. This data are send wireless into 500 m distant station. Potential ways of solution are gradually studied and final design suggested. Detailed implementation methods are described in the following section. Ultrasonic sensors are employed for level measurement and controlling element is processor ATmega162, data are transmitted by transceiver RC1280HP. Apparatus is suggested with a view to the lowest power consumption considering it will be supplied only with a accumulator. Solving of accepting station is not a part of the thesis. Functional tested sample is understated in the execution section.
24
Fougeron, Denis. "Etude et mise en oeuvre de cellules résistantes aux radiations dans le cadre de l'évolution du détecteur à pixels d'Atlas technologie CMOS 65 nm." Electronic Thesis or Diss., Toulon, 2020. http://www.theses.fr/2020TOUL0005.
Full textAbstract:
Cette étude s’inscrit dans le cadre d’une collaboration internationale, RD53, et qui vise à fournir à la communauté scientifique un ASIC « Front-End » de lecture du futur détecteur pixels courant 2022. La technologie 65 nm choisie par la communauté scientifique devra fonctionner dans un environnement extrêmement radioactif (10 MGray) pendant cinq ans d’exploitation sans maintenance possible.Deux approches expérimentales sont décrites dans ce mémoire : 1. Des études en irradiation ont été réalisées afin d'estimer la tolérance à la dose (TID) du process 65 nm pour fixer des règles de conception qui peuvent être respectées pour les cellules numériques et analogiques implantées dans le circuit final. Des véhicules de test (PCM) ont été définis pour être irradiés à l’aide d’une source de rayons X (10 keV – 3 kW) afin d'estimer les effets de dose. Les résultats obtenus sont synthétisés dans les chapitres concernés. 2. Dans le but d'optimiser l'immunité des points mémoires aux effets des SEU, plusieurs circuits prototypes ont été conçus. Ils incluent différentes architectures en vue d’être irradiées. Plusieurs campagnes d'irradiation ont été menées en utilisant un faisceau d'ions lourds et un faisceau de protons à dessein de comparer leur comportement et d’en extraire une cross-section la plus précise possible<br>This study is inside an international collaboration context, RD53, which its goal is to provide to the scientific community an electronic front-end for the readout of the future pixel detector in 2022. The 65 nm technology chosen by the collaboration will have to be operational in a highly radioactive environment (10 MGray) for five years without maintenance operation.Two experimental approaches are described in this thesis: 1. Irradiation studies were carried out to estimate the dose tolerance (TID) of the 65 nm process to fix all essentials design rules for digital and analog cells implanted in the final circuit. Test vehicles (PCM) were defined for irradiation using an X-ray source (10 keV - 3 kW) to estimate dose effects. The results we obtained are summarized in the document. 2. In order to optimize the tolerance of memories to the SEE effects, several ASIC prototypes havebeen designed. These prototypes include different architectures for irradiation characterization. Several irradiation campaigns have been carried out using a heavy ion beam and a proton beam in order to a cross-section as accurate as possible
25
Fanning, Sarah Elizabeth. "Changing fictions of masculinity : adaptations of Jane Eyre and Wuthering Heights, 1939-2009." Thesis, University of Exeter, 2012. http://hdl.handle.net/10871/8524.
Full textAbstract:
The discursive and critical positions of the ‘classic’ nineteenth-century novel, particularly the woman’s novel, in the field of adaptation studies have been dominated by long-standing concerns about textual fidelity and the generic processes of the text-screen transfer. The sociocultural patterns of adaptation criticism have also been largely ensconced in representations of literary women on screen. Taking a decisive twist from tradition, this thesis traces the evolution of representations of masculinity in the malleable characters of Rochester and Heathcliff in film and television adaptations of Charlotte Brontë’s Jane Eyre and Emily Brontë’s Wuthering Heights between 1939 and 2009. Concepts of masculinity have been a neglected area of enquiry in studies of the ‘classic’ novel on screen. Adaptations of the Brontës’ novels, as well as the adapted novels of other ‘classic’ women authors such as Jane Austen, George Eliot and Elizabeth Gaskell, increasingly foreground male character in traditionally female-oriented narratives or narratives whose primary protagonist is female. This thesis brings together industrial histories, textual frames and sociocultural influences that form the wider contexts of the adaptations to demonstrate how male characterisation and different representations of masculinity are reformulated and foregrounded through three different adaptive histories of the narratives of Jane Eyre and Wuthering Heights. Through the contours of the film and television industries, the application of text and context analysis, and wider sociocultural considerations of each period an understanding of how Rochester and Heathcliff have been transmuted and centralised within the adaptive history of the Brontë novel.
26
Cheng, Jay, and 鄭傑. "On Generalized Hamming Weights of Linear Block Codes." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/58867308564051097365.
Full text
27
Chen, Hung-Ta, and 陳宏達. "Improving Steganographic Embedding Efficiency by Combining Ternary Hamming Codes and Wet Paper Codes." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/43343876946405245254.
Full textAbstract:
碩士<br>國立中興大學<br>電機工程學系所<br>100<br>High-performance steganography requires large embedding rate and small distortion, i.e., high embedding efficiency. In this study, we proposed a method to embed message into first and second LSB of gray-scale signals. The embedding system can be divided into two layers. The first layer can use arbitrary code to embedding. The second layer combines ternary Hamming codes and wet paper codes. In the second layer, we compute the Hamming code syndrome first and use it as the wet paper channel for embedding. Using this method, we can increase embedding rate.
28
Wu, Po-Ting, and 吳柏霆. "A Data Hiding Scheme with Secret Sharing Based on Hamming Codes." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/jp5dn3.
Full textAbstract:
碩士<br>輔仁大學<br>資訊工程學系碩士班<br>103<br>A secret image can be embedded into n cover images by the (t, n)-threshold secret sharing method, generating n camouflage images. To reconstruct the secret image, the method requires at least t out of the n camouflage images. There are two stages in the (t, n)-threshold secret sharing method. The first stage is to embed the secret image, and the second stage is to reconstruct the secret image. When embedding the secret image, how to reduce cover image distortion is a major problem. This paper proposes to use (7, 4) Hamming code, to embed the secret image. Because Hamming code only needs to modify a few bits of a codeword when it embeds multiple bits, it can significantly reduce camouflage image distortion to lower the probability of being perceived by the attacker. Since the power-of-two Galois fields can losslessly reconstruct the secret image, we use a power-of-two Galois field rather than prime Galois fields. Our experimental results show that the camouflage images quality of our scheme is better than those of the other previous algorithms.
29
Azar, GHADY. "On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels." Thesis, 2013. http://hdl.handle.net/1974/8111.
Full textAbstract:
Most of the basic concepts of algebraic coding theory are derived for the memoryless binary symmetric channel. These concepts do not necessarily hold for time-varying channels or for channels with memory. However, errors in real-life channels seem to occur in bursts rather than independently, suggesting that these channels exhibit some statistical dependence or memory. Nonetheless, the same algebraic codes are still commonly used in current communication systems that employ interleaving to spread channel error bursts over the set of received codewords to make the channel appear memoryless to the block decoder. This method suffers from immediate shortcomings as it fails to exploit the channel’s memory while adding delay to the system. We study optimal maximum likelihood block decoding of binary codes sent over several binary additive channels with infinite and finite memory. We derive conditions on general binary codes and channels parameters under which maximum likelihood and minimum distance decoding are equivalent. The channels considered in this work are the infinite and finite memory Polya contagion channels, the queue-based channel, and the Gilbert-Elliott channel. We also present results on the optimality of classical perfect and quasi-perfect codes when used over the aforementioned channels under maximum likelihood decoding.<br>Thesis (Master, Mathematics & Statistics) -- Queen's University, 2013-07-12 13:45:35.294
30
Bade, Peter. "A 1Mbps 0.18μm CMOS Soft-output Decoder for Product Turbo Codes". Thesis, 2009. http://hdl.handle.net/1807/17493.
Full textAbstract:
A product turbo code (PTC) decoder application specific integrated circuit (ASIC) is designed in 0.18μm 1P6M CMOS with embedded SRAM. From simulation, an operating frequency of 73.1 MHz at typical conditions is obtained, yielding a throughput of 3.8 Mbps with 4 decoding iterations, while consuming 103.4 mW. The total area is 5.13 mm2. Assuming the ASIC would be used as a hard macro, the area could be reduced to 1.7 mm2. The ASIC was tested at 20 MHz under typical conditions, which resulted in a throughput of 1.0 Mbps at 1.8V supply while consuming 36.6 mW.
By making a slight modification, this design can be easily scaled to support IEEE 802.16d WiMAX. Allow for this, and moving to a 45nm process an estimated throughput of 9.44 Mbps with 4 iterations can be obtained. Total macro area would be approximately 0.11 mm2.
31
鄭兆晏. "Design and Analysis of an Efficient Approach for Parital-Sum Queries in Data Cubes Using Hamming-based Codes." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/85378956987241190645.
Full textAbstract:
碩士<br>臺南師範學院<br>資訊教育研究所<br>89<br>Abstract
For the general application of OLAP, users can analyze aggregate data from the data warehouse. A typical structure for OLAP is a data cube, which is composed of cells. Because of the real-time request in a data cube, how to speed up aggregate values of some specified cells demanded from a query is an important research topic. The types of an aggregate data query can be divided into two ways. One is the continuous data query, called a range-sum query. The other one is the discrete data query, called a parital-sum query. We focus our research in the latter one. The proposed methods to solve a parital-sum query are using a covering code approach and creating the index look-up table. However, their major drawback is wasting too much memory space for the index look-up table. In this thesis, we will propose an efficient method, called HBC（Hamming-based Code）method, for supporting a partial-sum query. The main idea is to establish a seed table by applying hamming-based codes. Via the seed table that, we can use its error-detection function to find the seed and error bit quickly in a query process, and save much memory space. Moreover, we will also extend the HBC method to handle mutiple-error problem, such that the users are able to establish a distinct seed table according to their request. For dynamic data cubes, the seed table only needs to change some part of seeds without reconstruction. Furthermore, we can expand the HBC method for the multidimensional partial sum problem. Finally, we will consider the probability of query on each cell to improve access performance. Our method will be evaluated using analytical cost model, and the analytical results indicate that it has a better performance than the others.
32
Jubinville, Jason. "Evaluation of intra-set clustering techniques for redundant social media content." Thesis, 2018. https://dspace.library.uvic.ca//handle/1828/10438.
Full textAbstract:
This thesis evaluates various techniques for intra-set clustering of social media data from an industry perspective. The research goal was to establish methods for reducing the amount of redundant information an end user must review from a standard social media search. The research evaluated both clustering algorithms and string similarity measures for their effectiveness in clustering a selection of real-world topic and location-based social media searches. In addition, the algorithms and similarity measures were tested in scenarios based on industry constraints such as rate limits. The results were evaluated using several practical measures to determine which techniques were effective.<br>Graduate
33
Hrinčárová, Monika. "Audio steganografie a IP telefonie." Master's thesis, 2015. http://www.nusl.cz/ntk/nusl-347234.
Full textAbstract:
Steganography is a technique which hides secret information. In this work, we will hide a secret information in the packets which are produced during a Skype call. Skype is one of the best known and the most widely used VoIP applications. We will propose, describe and implement a steganography method by which we will send the secret message during the Skype call. For embedding the message into packets and extracting them, we will use steganographic method called matrix encoding. To avoid packet loss, we will increase the robustness of this method by error-correcting and self-synchronising codes. As error-correcting codes, we will use the binary Hamming (7, 4) -codes and for the self-synchronising, we will use T-codes. 1
34
Hrinčárová, Monika. "Audio steganografie a IP telefonie." Master's thesis, 2017. http://www.nusl.cz/ntk/nusl-357346.
Full textAbstract:
Steganography is a technique which hides secret information. In this work, we will hide a secret information in the packets which are produced during a Skype call. Skype is one of the best known and the most widely used VoIP applications. We will propose, describe and implement a steganography method by which we will send the secret message during the Skype call. For embedding the message into packets and extracting them, we will use steganographic method called matrix encoding. To avoid packet loss, we will increase the robustness of this method by error-correcting and self-synchronising codes. As error-correcting codes, we will use the binary Hamming (7, 4) -codes and for the self-synchronising, we will use T-codes. 1
35
Staphorst, Leonard. "Viterbi Decoded Linear Block Codes for Narrowband and Wideband Wireless Communication Over Mobile Fading Channels." Diss., 2005. http://hdl.handle.net/2263/27090.
Full textAbstract:
Since the frantic race towards the Shannon bound [1] commenced in the early 1950’s, linear block codes have become integral components of most digital communication systems. Both binary and non-binary linear block codes have proven themselves as formidable adversaries against the impediments presented by wireless communication channels. However, prior to the landmark 1974 paper [2] by Bahl et al. on the optimal Maximum a-Posteriori Probability (MAP) trellis decoding of linear block codes, practical linear block code decoding schemes were not only based on suboptimal hard decision algorithms, but also code-specific in most instances. In 1978 Wolf expedited the work of Bahl et al. by demonstrating the applicability of a block-wise Viterbi Algorithm (VA) to Bahl-Cocke-Jelinek-Raviv (BCJR) trellis structures as a generic optimal soft decision Maximum-Likelihood (ML) trellis decoding solution for linear block codes [3]. This study, largely motivated by code implementers’ ongoing search for generic linear block code decoding algorithms, builds on the foundations established by Bahl, Wolf and other contributing researchers by thoroughly evaluating the VA decoding of popular binary and non-binary linear block codes on realistic narrowband and wideband digital communication platforms in lifelike mobile environments. Ideally, generic linear block code decoding algorithms must not only be modest in terms of computational complexity, but they must also be channel aware. Such universal algorithms will undoubtedly be integrated into most channel coding subsystems that adapt to changing mobile channel conditions, such as the adaptive channel coding schemes of current Enhanced Data Rates for GSM Evolution (EDGE), 3rd Generation (3G) and Beyond 3G (B3G) systems, as well as future 4th Generation (4G) systems. In this study classic BCJR linear block code trellis construction is annotated and applied to contemporary binary and non-binary linear block codes. Since BCJR trellis structures are inherently sizable and intricate, rudimentary trellis complexity calculation and reduction algorithms are also presented and demonstrated. The block-wise VA for BCJR trellis structures, initially introduced by Wolf in [3], is revisited and improved to incorporate Channel State Information (CSI) during its ML decoding efforts. In order to accurately appraise the Bit-Error-Rate (BER) performances of VA decoded linear block codes in authentic wireless communication environments, Additive White Gaussian Noise (AWGN), flat fading and multi-user multipath fading simulation platforms were constructed. Included in this task was the development of baseband complex flat and multipath fading channel simulator models, capable of reproducing the physical attributes of realistic mobile fading channels. Furthermore, a complex Quadrature Phase Shift Keying (QPSK) system were employed as the narrowband communication link of choice for the AWGN and flat fading channel performance evaluation platforms. The versatile B3G multi-user multipath fading simulation platform, however, was constructed using a wideband RAKE receiver-based complex Direct Sequence Spread Spectrum Multiple Access (DS/SSMA) communication system that supports unfiltered and filtered Complex Spreading Sequences (CSS). This wideband platform is not only capable of analysing the influence of frequency selective fading on the BER performances of VA decoded linear block codes, but also the influence of the Multi-User Interference (MUI) created by other users active in the Code Division Multiple Access (CDMA) system. CSS families considered during this study include Zadoff-Chu (ZC) [4, 5], Quadriphase (QPH) [6], Double Sideband (DSB) Constant Envelope Linearly Interpolated Root-of- Unity (CE-LI-RU) filtered Generalised Chirp-like (GCL) [4, 7-9] and Analytical Bandlimited Complex (ABC) [7, 10] sequences. Numerous simulated BER performance curves, obtained using the AWGN, flat fading and multi-user multipath fading channel performance evaluation platforms, are presented in this study for various important binary and non-binary linear block code classes, all decoded using the VA. Binary linear block codes examined include Hamming and Bose-Chaudhuri-Hocquenghem (BCH) codes, whereas popular burst error correcting non-binary Reed-Solomon (RS) codes receive special attention. Furthermore, a simple cyclic binary linear block code is used to validate the viability of employing the reduced trellis structures produced by the proposed trellis complexity reduction algorithm. The simulated BER performance results shed light on the error correction capabilities of these VA decoded linear block codes when influenced by detrimental channel effects, including AWGN, Doppler spreading, diminished Line-of-Sight (LOS) signal strength, multipath propagation and MUI. It also investigates the impact of other pertinent communication system configuration alternatives, including channel interleaving, code puncturing, the quality of the CSI available during VA decoding, RAKE diversity combining approaches and CSS correlation characteristics. From these simulated results it can not only be gathered that the VA is an effective generic optimal soft input ML decoder for both binary and non-binary linear block codes, but also that the inclusion of CSI during VA metric calculations can fortify the BER performances of such codes beyond that attainable by classic ML decoding algorithms.<br>Dissertation (MEng(Electronic))--University of Pretoria, 2006.<br>Electrical, Electronic and Computer Engineering<br>unrestricted
36
chen, bo-rong, and 陳柏融. "Low Distortion Data Hiding Using Hamming Code." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/u8whh5.
Full textAbstract:
碩士<br>逢甲大學<br>資訊工程所<br>100<br>The paper proposed a new method for data hiding , and reducing the image damage. Recently lots of data hiding method are proposed , and how to improve the image after data hiding become a challenge. The paper uses the syndrome from hamming code , and using the syndrome table for index. And we uses the table to design a new data hiding method. Our embedded amount is that embedding one information bit into one pixel , and we can get the PSNR value is 52.57(db), also can reducing the distortion to 0.3594. And we can compare with the three data hiding methods, and our image PSNR value are better than others from the experiment result.
37
Chen, Shan-Kang, and 陳善康. "A Halftone Image Authentication and Localization Method Using Hamming Code." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/50362569289258312346.
Full textAbstract:
碩士<br>輔仁大學<br>資訊工程學系碩士班<br>102<br>This paper proposes a blind block-chain based fragile watermarking scheme for halftone image authentication and temper localization. In the proposed method, a halftone image is partitioned into blocks. All blocks form a linear space-filling curve chain, and the Cyclic Redundancy Check (CRC) of every image block is hidden in the next block of the block-chain. At data hiding, the original image is divided into two parts: host pixels for carrying CRC and slave pixels for avoiding degradation of visual quality respectively. The CRC is embedded in the host pixels using the Hamming code with embedding efficiency. Each host pixel is toggled with one slave pixel with opposite value to keep the visual quality. In the tamper detection process, the legitimacy of image block is determined by the CRC of the block and the following block’s watermark in the block-chain. As the result of experiment, the proposed method was confirmed to be able to detect the tampered parts of the image with good visual quality.
38
Cheng, Shih-Sheng, and 鄭時昇. "Low-Power Dependable Content Addressable Memory Based on Hamming Code Precomputation." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/85665580477783730368.
Full textAbstract:
碩士<br>國立彰化師範大學<br>電子工程學系<br>101<br>Abstract
Content addressable memory has the advantage of high-speed data searching, so it is widely used in communication network and cache system. However, owing to mass and parallel comparison, the area overhead, power dissipation and reliability are still the major issues for content addressable memory device.
Precomputation is usually applied for predictive speedup and power disabling. In this paper low-power precomputation is surveyed in view of subspace codes. Four efficient subspace codes are proposed for precomputation based content address memory design. The side benefits are also surveyed and analyzed in the experiments. From our evaluations the MSB concept can be combined with m/n codes or sentry tagging with few overhead. Berger and m/n codes can be applied to hold the equal-weight property for cell reduction or searching-once. The proposed precomputation using Hamming codes can take more benefits on small checkers and error correction.
The proposed precomputation using Hamming codes can take more benefits on low-power, small checkers and error correction. The novel Hamming codes are presented for improve the power consumption of 30%.
Keywords: Precomputation, Subspace code, Content addressable memory,Hamming code
39
Chou, Yung-Shun, and 周詠順. "Data Hiding Schemes Based on Hamming Code and Pixel Overlapping Approach." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/rwja64.
Full textAbstract:
碩士<br>國立東華大學<br>資訊工程學系<br>106<br>Data hiding (DH) is a significant research field which combines cryptography and digital multimedia processing. DH can widely used in digital multimedia, especially digi-tal images. Matrix code DH (MCDH) by covering function is based on error correcting code, which has high embedding efficiency, and meanwhile decreases the number of modified bits. Up to date, there are already MCDHs proposed. Most researches on MCDH uses using Hamming code, BCH code, and Golay code.
A we-known MCDH is based on Hamming coding HC(n, k), by covering function COV(1, n = 2k − 1, k), which is referred to as HDH. Afterwards, Hamming+ 1 DH (H1DH) was introduced, and it had a better embedding efficiency when compared with HDH. Consider DH on pixel domain. MCDH has a great relation with Least Significant Bit (LSB) and Optimal Pixel Adjustment Process (OPAP). In fact, these methods are very similar, but use different ways for modifying bits.
In this thesis, we propose Hamming+k DH (HkDH) and Hamming+k with m over-lapped pixels DH (Hk_mDH) which integrate the approaches of LSB, OPAP, and H1DH. HkDH may embed 2k secret bits in n pixels. It uses LSB substitution when embedding the first k bit, and then modified 2nd LSB when embed the second k bits. Modifying the 2nd LSB may have collision problem, we can use OPAP to solve it. On the other hand, Hk_mDH embeds 2k bits in (2n – m) pixels. It uses LSB substitution when embed the first k bits. When embedding the second k bits, the modifications in overlapped pixels adopt OPAP. The modifications in other (n – m) pixels still use LSB substitution. For Hk_mDH, we decrease modifications but reduce embedding capacity due to m over-lapped pixels.
40
HUANG, CHING-CHIEH, and 黃勁傑. "Data Hiding in Halftone Images Using Hamming Code and Hilbert Curve." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/99986495057167154448.
Full textAbstract:
碩士<br>輔仁大學<br>資訊工程學系碩士班<br>104<br>Halftone images are widely used in the printing industries. Hiding data directly into halftone images can be used to assure the integrity of the media or to embed secret message and auxiliary data. In this paper, we present a simple but novel improved high capacity data hiding method. The proposed method decreases the chance of forced single-pixel toggling by a pixel-pair swapping which is selected out of a sequence of candidate pairs along Hilbert curve for a group of to-be-embedded bits using the Hamming code. The proposed method can significantly improve the visual quality of marked halftone images especially for high-capacity data hiding. Experimental results show that the proposed scheme outperforms the previous scheme.
41
Wang, Weisheng, and 王威勝. "An Improved Data Hiding Method on Halftone Images Using Hamming Code." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/04573549260566729311.
Full textAbstract:
碩士<br>輔仁大學<br>資訊工程學系碩士班<br>101<br>Halftone images are widely used in the printing industries. Hiding data directly into halftone images can be used to assure the integrity of the media or to embed secret message and auxiliary data. In this paper, we present a high visual quality and high capacity data hiding method for halftone images. Data hiding smart pair toggling (DHSPT) is a flexible method for hiding data directly into halftone images in high embedded capacity applications. It increased visual quality of marked halftone images by pair-toggling instead of forced single-pixel toggling. Data hiding using hamming code (DHHC) increased the visual quality by embedding multiple bits into a block of pixels by forced single-pixel toggling. In this paper, we provide a new data hiding scheme which combines the advantages of both DHSPT and DHHC. Experimental results show that our proposed method dramatically decreases the chance of forced single-pixel toggling of DHHC. The proposed method avoids the chance of forced single-pixel toggling and thus significantly improves the visual quality of marked halftone images especially for high-capacity data hiding.
42
Shi, Allen, and 施彥任. "A New Fingerprinting System Based on Gray Scale Watermarking and Hamming Code." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/59984088015382296787.
Full textAbstract:
碩士<br>國立臺中技術學院<br>多媒體設計研究所<br>94<br>As the internet becomes more and more popular, there is also an increased use of digital
images on it. However, protecting intellectual property rights and keeping tracks of
end-users with rights to use similar copies of a digital image have become extremely
important and urgent. To prevent piracies of images, finger printing techniques have been
applied to images before they are being distributed. The fingerprint can be a unique ID that
will be hidden in each image. The fingerprint can be retrieved later on to prove the
ownership of the image or who the legal users are. However users could collude to tamper
with the images to generate copies of tampered images for illegal purposes. One collusion
method is to take parts from different legal copies and pieced them together to form a
newly colluded image. That is the colluded image contained parts from several authentic
fingerprinted images. Another kind of collusion is to average each overlapping pixels from
several legal copies to create a colluded copy. The hidden fingerprints would be corrupted
in the colluded images from being made up of parts from several other fingerprint images
or by averaging, respectively. In this thesis, the proposed fingerprint technique applies the
discrete cosine wavelet transform on the original image whereby a gray fingerprint image
would be hidden in the transformed domain. The gray fingerprint image consists of a
unique ID code. During recovery, Hamming code is used to improve the quality of the
recovered fingerprint ID in the event it is corrupted by collusion. Experimental results
show that the fingerprint technique is resistant to collusion attacks. In fact the IDs of the
colluders could be identified and used to prove the rightful ownership of the image and also
to pinpoint the colluders.
43
Wu, Ming-Ying, and 吳明穎. "A Study on the Data Hiding Algorithms Based on Product Hamming Perfect Code." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/41699941341631163295.
Full textAbstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>102<br>Based on the concept of matrix embedding and the product (7,4) Hamming perfect code, two product Hamming code based data hiding algorithms are investigated. The evaluation of data hiding should be done by the embedding rate and the embedding efficiency. Usually the required computational complexity in finding the optimal hiding solution with the highest quantity of message hiding is extremely high. In the literature, there are two sub-optimal approaches with lower complexity and good embedding efficiency, one is the row-column algorithm, and the other is the weight approximation embedding algorithm. In the thesis, both schemes are deeply studied by the theoretical analysis and experiments. Moreover, another one sub-optimal approach is also proposed.
44
LIN, CHIH-HAO, and 林. 志壕. "An Improved Data Hiding Scheme using Hamming Code in Halftone Images Based on Error Diffusion." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/79365348602008656462.
Full textAbstract:
碩士<br>輔仁大學<br>資訊工程學系碩士班<br>104<br>In this paper, we propose an improved data hiding scheme using Hamming code in halftone images based on error diffusion. First, our scheme uses space filling curve to divide the image into sub-images and each sub-image is dispersed of the original image. Then, does the error diffusion in gray-level images by sub-images index, and produces the fixed length sequence of the halftoning binary code according to the rule of Hamming code. In the previous scheme, the fixed length sequence of the covering code error diffusion is a contiguous block of neighboring pixels, the error of the embedded pixel can’t be completely diffused to its neighbors. Since the pixels in the embedding block of our method are dispersed in the image, the error of the embedded pixel can be completely diffused to its neighbors. The experimental results shows that the quality of stego-halftone image of our scheme is better than that of the previous scheme.
45
Dyer, Jennifer. "The role of Archaeology in the Jesus industry." Diss., 2015. http://hdl.handle.net/10500/21003.
Full textAbstract:
The question leading to this study is whether the facts and theories pertaining to the
Bible and Jesus Story as presented by The Authors (H Schonfield, D Joyce, B Thiering, M
Baigent, R Leigh, H Lincoln; M Starbird, and D Brown) could be verified by the
Archaeology evidence. I have adopted a multidiscipline and holistic approach
considering information gathered from all media sources to ascertain what theories, if
any could replace the traditional Jesus Story of the New Testament. I considered
whether the alternative theories or traditional theories were believable due to the
evidence presented by Biblical Archaeology or by the techniques used by The Authors
in presenting their facts. By using Thouless’ system of Straight and Crooked thinking I
was able to ascertain that the theories used in the novels written by The Authors may
have been persuasive, but lacked substance.<br>Biblical and Ancient Studies<br>M. Th. (Biblical Archaeology)