Log in

Relevant bibliographies by topics / Codes / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Codes.

Dissertations / Theses on the topic 'Codes'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic '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

Xu, Danfeng. "Iterative coded multiuser detection using LDPC codes." Thesis, University of Ottawa (Canada), 2007. http://hdl.handle.net/10393/27939.

Full text

Abstract:

Multiuser detection (MUD) has been regarded as an effective technique for combating cochannel interference (CCI) in time-division multiple access (TDMA) systems and multiple access interference (MAI) in code-division multiple access (CDMA) systems. An optimal multiuser detector for coded multiuser systems is usually practically infeasible due to the associated complexity. An iterative receiver consisting of a soft-input soft-output (SISO) multiuser detector and a bank of SISO single user decoders can provide a system performance which approaches to that of single user system after a few itera

APA, Harvard, Vancouver, ISO, and other styles

2

Ozadam, Hakan. "Repeated-root Cyclic Codes And Matrix Product Codes." Phd thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12615304/index.pdf.

Full text

Abstract:

We study the Hamming distance and the structure of repeated-root cyclic codes, and their generalizations to constacyclic and polycyclic codes, over finite fields and Galois rings. We develop a method to compute the Hamming distance of these codes. Our computation gives the Hamming distance of constacyclic codes of length $np^s$ in many cases. In particular, we determine the Hamming distance of all constacyclic, and therefore cyclic and negacyclic, codes of lengths p^s and 2p^s over a finite field of characteristic $p$. It turns out that the generating sets for the ambient space obtained by tor

APA, Harvard, Vancouver, ISO, and other styles

3

Al, Kharoosi Fatma Salim Ali. "Describing quaternary codes using binary codes." Thesis, Queen Mary, University of London, 2011. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1312.

Full text

Abstract:

For a quaternary code C of length n, de ne a pair of binary codes fC1;C2g as: -C1 = C mod 2 -C2 = h(C \ 2Zn 4 ) where h is a bijection from 2Z4 to Z2 mapping 0 to 0 and 2 to 1 and for the extension to a map acting coordinatewise. Here C1 C2. For a pair of binary codes fC1;C2g with C1 C2, let C(C1;C2) be the set of Z4-codes giving rise to this binary pair as de ned above. Our main goal is to describe the set C(C1;C2) using the binary pair of codes fC1;C2g. In Chapter 1, we give some preliminaries. In Chapter 2, we start with a general description of codes fC1;C2g which give cardinality of C(C1;

APA, Harvard, Vancouver, ISO, and other styles

4

Skoglund, Isabell. "Reed-Solomon Codes - Error Correcting Codes." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-97343.

Full text

Abstract:

In the following pages an introduction of the error correcting codes known as Reed-Solomon codes will be presented together with different approaches for decoding. This is supplemented by a Mathematica program and a description of this program that gives an understanding in how the choice of decoding algorithms affect the time it takes to find errors in stored or transmitted information.

APA, Harvard, Vancouver, ISO, and other styles

5

Harrington, James William Preskill John P. "Analysis of quantum error-correcting codes : symplectic lattice codes and toric codes /." Diss., Pasadena, Calif. : California Institute of Technology, 2004. http://resolver.caltech.edu/CaltechETD:etd-05122004-113132.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Xia, Bo. "Importance sampling for LDPC codes and turbo-coded CDMA." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/290093.

Full text

Abstract:

Low-density parity-check (LDPC) codes have shown capacity-approaching performance with soft iterative decoding algorithms. Simulating LDPC codes at very low error rates normally takes an unacceptably long time. We consider importance sampling (IS) schemes for the error rate estimation of LDPC codes, with the goal of dramatically reducing the necessary simulation time. In IS simulations, the sample distribution is biased to emphasize the occurrence of error events and efficiency can be achieved with properly biased sample distributions. For LDPC codes, we propose an IS scheme that overcomes a d

APA, Harvard, Vancouver, ISO, and other styles

7

Tixier, Audrey. "Reconnaissance de codes correcteurs." Electronic Thesis or Diss., Paris 6, 2015. http://www.theses.fr/2015PA066554.

Full text

Abstract:

Dans cette thèse, nous nous intéressons au problème de la reconnaissance de code. Ce problème se produit principalement lorsqu'une communication est observée dans un milieu non-coopératif. Une liste de mots bruités issus d'un code inconnu est obtenue, l'objectif est alors de retrouver l'information contenue dans ces mots bruités. Pour cela, le code utilisé est reconstruit afin de décoder les mots observés. Nous considérons ici trois instances de ce problème et proposons pour chacune d'elle une nouvelle méthode. Dans la première, nous supposons que le code utilisé est un turbo-code et nous prop

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Xuesong. "Cartesian authentication codes from error correcting codes /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20WANGX.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Dicuangco, Lilibeth. "On duadic codes and split group codes." Nice, 2006. http://www.theses.fr/2006NICE4098.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kim, Han Jo. "Improving turbo codes through code design and hybrid ARQ." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0012169.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Webb, Betsy M. "Clashing Codes: How Unwritten Codes Collide with Professional and Personal Codes in Educational Settings." Fogler Library, University of Maine, 2008. http://www.library.umaine.edu/theses/pdf/WebbB2008.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Pak, Anne On-Yi 1977. "Euclidean space codes as space-time block codes." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86722.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Guenda, Kenza. "On algebraic geometric codes and some related codes." Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/2033.

Full text

Abstract:

Thesis (MSc (Mathematics))--University of Stellenbosch, 2006.<br>The main topic of this thesis is the construction of the algebraic geometric codes (Goppa codes), and their decoding by the list-decoding, which allows one to correct beyond half of the minimum distance. We also consider the list-decoding of the Reed–Solomon codes as they are subclass of the Goppa codes, and the determination of the parameters of the non primitive BCH codes. AMS Subject Classification: 4B05, 94B15, 94B35, 94B27, 11T71, 94B65,B70. Keywords: Linear codes, cyclic codes, BCH codes, Reed–Solomon codes, list-de

APA, Harvard, Vancouver, ISO, and other styles

14

BRUYERE, VERONIQUE. "Codes prefixes, codes a delai de dechiffrage borne." Paris 7, 1989. http://www.theses.fr/1989PA077180.

Full text

Abstract:

La theorie des codes a longueur variable est nee des travaux de shannon sur l'information. Elle a ete developpee par schutzenberger dans les annees 60, et a sa suite par de nombreux chercheurs. Dans ce travail, nous etudions deux familles de codes, les codes prefixes et les codes a delai de dechiffrage borne qui les generalisent. Nous apportons une reponse a certaines des questions posees dans le livre theory of codes de j. Berstel et d. Perrin (1985). Nous etudions dans le chapitre 2 les ensembles de mots x et y dont le produit xy est un code prefixe maximal. Schutzenberger avait prouve que l

APA, Harvard, Vancouver, ISO, and other styles

15

Jin, Yonggang Wilson R. M. Wilson R. M. Solomon Gustave. "Box codes and convolutional coding of block codes /." Diss., Pasadena, Calif. : California Institute of Technology, 1995. http://resolver.caltech.edu/CaltechETD:etd-10082007-080629.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Chabot, Christophe. "Reconnaissance de codes, structure des codes quasi-cycliques." Limoges, 2009. https://aurore.unilim.fr/theses/nxfile/default/ca1051fa-cdfe-4a04-8251-fb35a0ef5b5e/blobholder:0/2009LIMO4036.pdf.

Full text

Abstract:

Dans cette thèse, nous abordons tout d'abord le problème de reconnaissance de codes. Il consiste à retrouver la structure d'un code correcteur d'erreurs utilisé lors d'une transmission de données seulement à partir de la séquence bruitée interceptée. Nous donnons ici des méthodes efficaces pour la reconnaissance d'un code connu, pour la reconstruction de codes appartenant à une famille tels que les codes cycliques et pour la détection des paramètres de codes convolutifs. Ensuite, nous étudions la structure des codes quasi-cycliques parallèlement aux résultats connus pour les codes cycliques. N

APA, Harvard, Vancouver, ISO, and other styles

17

Klaimi, Rami. "Etude de turbocodes non binaires pour les futurs systèmes de communication et de diffusion." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2019. http://www.theses.fr/2019IMTA0141.

Full text

Abstract:

Les systèmes de téléphonie mobile de 4ème et 5ème générations ont adopté comme techniques de codage de canal les turbocodes, les codes LDPC et les codes polaires binaires. Cependant, ces codes ne permettent pas de répondre aux exigences, en termes d’efficacité spectrale et de fiabilité, pour les réseaux de communications futurs (2030 et au-delà), qui devront supporter de nouvelles applications telles que les communications holographiques, les véhicules autonomes, l’internet tactile … Un premier pas a été fait il y a quelques années vers la définition de codes correcteurs d’erreurs plus puissan

APA, Harvard, Vancouver, ISO, and other styles

18

Fournier, Stéphan. "Turbo codes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq22763.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Yan, Yun. "Turbo codes." Ohio : Ohio University, 1999. http://www.ohiolink.edu/etd/view.cgi?ohiou1175200238.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Perry, Jonathan Ph D. Massachusetts Institute of Technology. "Spinal codes." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/78364.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from PDF student-submitted version of thesis.<br>Includes bibliographical references (p. 52-55).<br>Spinal codes are a new class of rateless codes that enable wireless networks to cope with time-varying channel conditions in a natural way, without requiring any explicit bit rate selection. The key idea in the code is the

APA, Harvard, Vancouver, ISO, and other styles

21

Ndjeya, Sélestin. "Codes autohermitiens." Aix-Marseille 2, 1988. http://www.theses.fr/1988AIX22056.

Full text

Abstract:

Cette these etudie les codes lineaires faiblement autohermitiens sur gf(q**(2m)), m etant un entier non nul. Ainsi, en les demultipliant par rapport aux bases trace-hermitiennes d'ordre m de gf(q**(2m)) sur gf(q), nous obtenons de nouveaux codes lineaires autoduaux sur gf(q)

APA, Harvard, Vancouver, ISO, and other styles

22

Ndjeya, Sélestin. "Codes autohermitiens." Grenoble 2 : ANRT, 1988. http://catalogue.bnf.fr/ark:/12148/cb37616823w.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Panagos, Adam G., and Kurt Kosbar. "A METHOD FOR FINDING BETTER SPACE-TIME CODES FOR MIMO CHANNELS." International Foundation for Telemetering, 2005. http://hdl.handle.net/10150/604782.

Full text

Abstract:

ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada<br>Multiple-input multiple output (MIMO) communication systems can have dramatically higher throughput than single-input, single-output systems. Unfortunately, it can be difficult to find the space-time codes these systems need to achieve their potential. Previously published results located good codes by minimizing the maximum correlation between transmitted signals. This paper shows how thi

APA, Harvard, Vancouver, ISO, and other styles

24

Tixier, Audrey. "Reconnaissance de codes correcteurs." Thesis, Paris 6, 2015. http://www.theses.fr/2015PA066554/document.

Full text

Abstract:

Dans cette thèse, nous nous intéressons au problème de la reconnaissance de code. Ce problème se produit principalement lorsqu'une communication est observée dans un milieu non-coopératif. Une liste de mots bruités issus d'un code inconnu est obtenue, l'objectif est alors de retrouver l'information contenue dans ces mots bruités. Pour cela, le code utilisé est reconstruit afin de décoder les mots observés. Nous considérons ici trois instances de ce problème et proposons pour chacune d'elle une nouvelle méthode. Dans la première, nous supposons que le code utilisé est un turbo-code et nous prop

APA, Harvard, Vancouver, ISO, and other styles

25

Hunt, Andrew W. "Hyper-codes, high-performance low-complexity error-correcting codes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0007/MQ32401.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Martin, Philippa Anne. "Adaptive iterative decoding : block turbo codes and multilevel codes." Thesis, University of Canterbury. Electrical and Electronic Engineering, 2001. http://hdl.handle.net/10092/7853.

Full text

Abstract:

New adaptive, iterative approaches to the decoding of block Turbo codes and multilevel codes are developed. Block Turbo codes are considered as they can readily provide high data rates, low decoding complexity and good performance. Multilevel codes are considered as they provide a moderate complexity approach to a high complexity code and can provide codes with good bandwidth efficiency. The work develops two adaptive sub-optimal soft output decoding algorithms for block Turbo codes. One is based on approximation and the other on the distance properties of the component codes. They can be use

APA, Harvard, Vancouver, ISO, and other styles

27

Otmani, Ayoub. "Codes Cortex et construction de codes auto-duaux optimaux." Limoges, 2002. http://www.theses.fr/2002LIMO0039.

Full text

Abstract:

Nous étudions une famille de codes correcteurs d'erreurs nommés codes CORTEX. La construction repose sur l'utilisation de codes de base de petites longueurs de rendement 1/2 assemblés en couches entre lesquelles sont insérées des permutations. Il est prouvé que l'auto-dualité est conservée par cette construction. De plus, les codes CORTEX construits à partir du code de Hamming étendu de longueur 8 sont de type I (resp. Type II) si le nombre de permutations est impair (resp. Pair). Cette thèse consiste en l'étude de cette famille de codes afin de fournir une construction effective de codes opti

APA, Harvard, Vancouver, ISO, and other styles

28

Muller, Wayne. "East City Precinct Design Code: Redevelopment through form-based codes." Master's thesis, University of Cape Town, 2014. http://hdl.handle.net/11427/12952.

Full text

Abstract:

Includes bibliographical references.<br>This thesis confines itself to a consideration of urban development opportunity in the East City Precinct through the understanding of it former historical character and memory which can be implemented through Form Based Codes. It locates the design process in the sub-regional context and puts forward notional spatial proposal for the physical area of the East City Precinct and its surrounds. The application of theory is tested at precinct level and emphasis remains firmly on the public elements ordering the spatial structure. With all these consideratio

APA, Harvard, Vancouver, ISO, and other styles

29

Rodriguez, Fernandez Carlos Gustavo. "Machine learning quantum error correction codes : learning the toric code /." São Paulo, 2018. http://hdl.handle.net/11449/180319.

Full text

Abstract:

Orientador: Mario Leandro Aolita<br>Banca:Alexandre Reily Rocha<br>Banca: Juan Felipe Carrasquilla<br>Resumo: Usamos métodos de aprendizagem supervisionada para estudar a decodiﬁcação de erros em códigos tóricos de diferentes tamanhos. Estudamos múltiplos modelos de erro, e obtemos ﬁguras da eﬁcácia de decodiﬁcação como uma função da taxa de erro de um único qubit. Também comentamos como o tamanho das redes neurais decodificadoras e seu tempo de treinamento aumentam com o tamanho do código tórico.<br>Abstract: We use supervised learning methods to study the error decoding in toric codes ofdiff

APA, Harvard, Vancouver, ISO, and other styles

30

Kühn, Stefan. "Organic codes and their identification : is the histone code a true organic code." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86673.

Full text

Abstract:

Thesis (MSc)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: Codes are ubiquitous in culture|and, by implication, in nature. Code biology is the study of these codes. However, the term `code' has assumed a variety of meanings, sowing confusion and cynicism. The rst aim of this study is therefore to de ne what an organic code is. Following from this, I establish a set of criteria that a putative code has to conform to in order to be recognised as a true code. I then o er an information theoretical perspective on how organic codes present a viable method of dealing with biological i

APA, Harvard, Vancouver, ISO, and other styles

31

Maurice, Denise. "Codes correcteurs quantiques pouvant se décoder itérativement." Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066361/document.

Full text

Abstract:

On sait depuis vingt ans maintenant qu'un ordinateur quantique permettrait de résoudre en temps polynomial plusieurs problèmes considérés comme difficiles dans le modèle classique de calcul, comme la factorisation ou le logarithme discret. Entre autres, un tel ordinateur mettrait à mal tous les systèmes de chiffrement à clé publique actuellement utilisés en pratique, mais sa réalisation se heurte, entre autres, aux phénomènes de décohérence qui viennent entacher l'état des qubits qui le constituent. Pour protéger ces qubits, on utilise des codes correcteurs quantiques, qui doivent non seulemen

APA, Harvard, Vancouver, ISO, and other styles

32

Thayananthan, V. "Design of run-length limited partial unit memory codes for digital magnetic recording and trellis coded quantisation based on PUM codes." Thesis, Lancaster University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287264.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Tee, James Seng Khien. "On concatenated single parity check codes and bit interleaved coded modulation." Thesis, University of Canterbury. Electrical and Electronic Engineering, 2001. http://hdl.handle.net/10092/5463.

Full text

Abstract:

In recent years, the invention of Turbo codes has spurred much interest in the coding community. Turbo codes are capable of approaching channel capacity closely at a decoding complexity much lower than previously thought possible. Although decoding complexity is relatively low, Turbo codes are still too complex to implement for many practical systems. This work is focused on low complexity channel coding schemes with Turbo-like performance. The issue of complexity is tackled by using single parity check (SPC) codes, arguably the simplest codes known. The SPC codes are used as component codes

APA, Harvard, Vancouver, ISO, and other styles

34

Diallo, Amadou Tidiane. "Caractérisation analytique et optimisation de codes source-canal conjoints." Phd thesis, Université Paris Sud - Paris XI, 2012. http://tel.archives-ouvertes.fr/tel-00748545.

Full text

Abstract:

Les codes source-canal conjoints sont des codes réalisant simultanément une compression de données et une protection du train binaire généré par rapport à d'éventuelles erreurs de transmission. Ces codes sont non-linéaires, comme la plupart des codes de source. Leur intérêt potentiel est d'offrir de bonnes performances en termes de compression et de correction d'erreur pour des longueurs de codes réduites.La performance d'un code de source se mesure par la différence entre l'entropie de la source à compresser et le nombre moyen de bits nécessaire pour coder un symbole de cette source. La perfo

APA, Harvard, Vancouver, ISO, and other styles

35

Carlet, Claude. "Codes de reed-muller, codes de kerdock et de preparata." Paris 6, 1990. http://www.theses.fr/1990PA066066.

Full text

Abstract:

Nous etudions le code de reed-muller d'ordre 2 et le nombre de ses elements equilibres. Nous donnons une nouvelle caracterisation du code de kerdock et nous determinons son groupe d'automorphismes. Nous introduisons une nouvelle caracterisation des codes de reed-muller d'ordres quelconques, et nous en deduisons le degre de la fonction tr(au#k). Nous donnons enfin une nouvelle demonstration analytique de la dualite formelle des codes de kerdock et de preparata

APA, Harvard, Vancouver, ISO, and other styles

36

Karacayir, Murat. "Space-time Codes." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612028/index.pdf.

Full text

Abstract:

The phenomenon of fading constitutes a fundamental problem in wireless communications. Researchers have proposed many methods to improve the reliability of communication over wireless channels in the presence of fading. Many studies on this topic have focused on diversity techniques. Transmit diversity is a common diversity type in which multiple antennas are employed at the transmitter. Space-time coding is a technique based on transmit diversity introduced by Tarokh et alii in 1998. In this thesis, various types of space-time codes are examined. Since they were originally introduced in the

APA, Harvard, Vancouver, ISO, and other styles

37

Paterson, Maura Beth. "Dynamic frameproof codes." Thesis, Royal Holloway, University of London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.424457.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Papadopoulos, Constantinos. "Codes and trellises." Thesis, Queen Mary, University of London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Abbara, Mamdouh. "Turbo-codes quantiques." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00842327.

Full text

Abstract:

L'idée des turbo-codes, construction très performante permettant l'encodage de l'information classique, ne pouvait jusqu'à présent pas être transposé au problème de l'encodage de l'information quantique. En effet, il subsistait des obstacles tout aussi théoriques que relevant de leur implémentation. A la version quantique connue de ces codes, on ne connaissait ni de résultat établissant une distance minimale infinie, propriété qui autorise de corriger un nombre arbitraire d'erreurs, ni de décodage itératif efficace, car les turbo-encodages quantiques, dits catastrophiques, propagent certaines

APA, Harvard, Vancouver, ISO, and other styles

40

RAMOS, MARCELO CORREA. "LT CODES VARIATIONS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2010. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=16885@1.

Full text

Abstract:

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>A construção de novos códigos através de modificações (alongamento, puncionamento, etc) de um código conhecido é uma prática comum quando se lida com códigos clássicos. Neste trabalho é mostrado que bons códigos podem ser obtidos com algumas dessas técnicas, aparentemente não efetivas aos códigos fontanais. Os Códigos LT (Luby Transform) Sistemáticos Alongados são apresentados e, a partir de simulações realizadas em programa desenvolvido para tal, mostra-se um melhor desempenho em relação aos seus códigos-mãe correspondentes, sob

APA, Harvard, Vancouver, ISO, and other styles

41

Waugh, Karl Michael Vincent. "Partitions of codes." Thesis, University of Sussex, 2013. http://sro.sussex.ac.uk/id/eprint/45301/.

Full text

Abstract:

In this thesis we look at coding theory wherein we introduce the concept of perspective, a generalisation on the minimum distance of a code, which naturally leads to a partition of the code. Subsequently we introduce focused splittings, which shall be shown to be a generalisation of perfect codes. We investigate the existence of such objects, and address questions such as the complexity of finding a focused splittings, which we show to be NPComplete. We analyse the symmetries of focused splittings. We use focused splittings to address the problem of error correction and we construct an encodin

APA, Harvard, Vancouver, ISO, and other styles

42

Lundqvist, Anders. "Cyclically permutable codes." Doctoral thesis, Linköpings universitet, Datatransmission, 1997. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-123299.

Full text

Abstract:

A cyclically permutable code is a set of codewords having the property that no codeword is a cyclic shift of another codeword. We study the problem of constructing cyclically permutable codes of large size and low correlation. Cyclically permutable codes are used in code-division multiple-access systems realized by e.g. direct-sequence modulation or frequency-hopping. Advantages of code-division multiple-access to conventional access methods, such as timedivision and frequency-division, include greater flexibility, better robustness and that no synchronization among the transmitters is needed.

APA, Harvard, Vancouver, ISO, and other styles

43

Grosjean, Leefke. "Practical Anytime Codes." Doctoral thesis, KTH, Kommunikationsteori, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-185558.

Full text

Abstract:

The demand of an increasingly networked world is well reflected in modern industrial control systems where communication between the different components of the system is more and more taking place over a network. With an increasing number of components communicating and with hardware devices of low complexity, the communication resources available per communication link are however very limited. Yet, despite limited resources, the control signals transmitted over the link are still required to meet strict real-time and reliability constraints. This requires entirely new approaches in the inte

APA, Harvard, Vancouver, ISO, and other styles

44

Leconte, Michel. "Codes sans répétition." Paris 7, 1985. http://www.theses.fr/1985PA07F073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Guesnet, Yannick. "Codes et interprétations." Rouen, 2001. http://www.theses.fr/2001ROUES019.

Full text

Abstract:

Les travaux présentés dans ce mémoire se situent dans le cadre de la théorie des codes à longueurs variables. Nous introduisons deux nouvelles classes de codes : celle des codes à délai d'interprétation fini et celle des codes adjacents. Nous montrons que ces codes satisfont une extension au théorème du défaut. Nous montrons également l'équivalence entre la notion de maximalité dans la classe des codes à délai d'interprétation fini et celle de maximalité dans la classe des codes en général pour les codes à délai d'interprétation fini coupants. Nous proposons en outre deux méthodes de complétio

APA, Harvard, Vancouver, ISO, and other styles

46

Kosek, Peter M. "Error Correcting Codes." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1417508067.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Martin, Timothy Michael. "Codes of Interaction." VCU Scholars Compass, 2005. http://scholarscompass.vcu.edu/etd/849.

Full text

Abstract:

The ideas within this thesis are meant to clarify my explorations, research and painting practice during my studies at Virginia Commonwealth University. I expand on my general statements about being fascinated by advancing technologies and concerned about the after effects of these advancements. The writing explores my curiosity about the internal, skeletal structure of things and how they operate. I explain how the paintings are idiosyncratic hybrids that evoke animation, imaginary scientific propositions, blueprints, maps, and advancing technologies. The work combines these interests with my

APA, Harvard, Vancouver, ISO, and other styles

48

Lawson, John. "Duty specific code driven design methodology : a model for better codes." Thesis, University of Aberdeen, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274818.

Full text

Abstract:

The thesis examines Engineering Design and its methodology in general before examining and comparing the principal differences between Inventive Design and Development Design. This latter branch of design is described in detail, recognising that it is executed in accordance with recognised specifications, design codes and standards. Design Codes and Standards are analysed in terms of the service they provide to the professional design engineer who will normally work under the procedures and accepted standards of a Professional Design House. Professional design is an important part of all di

APA, Harvard, Vancouver, ISO, and other styles

49

Veluri, Subrahmanya Pavan Kumar. "Code Verification and Numerical Accuracy Assessment for Finite Volume CFD Codes." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/28715.

Full text

Abstract:

A detailed code verification study of an unstructured finite volume Computational Fluid Dynamics (CFD) code is performed. The Method of Manufactured Solutions is used to generate exact solutions for the Euler and Navier-Stokes equations to verify the correctness of the code through order of accuracy testing. The verification testing is performed on different mesh types which include triangular and quadrilateral elements in 2D and tetrahedral, prismatic, and hexahedral elements in 3D. The requirements of systematic mesh refinement are discussed, particularly in regards to unstructured meshes. D

APA, Harvard, Vancouver, ISO, and other styles

50

Firmanto, Welly T. (Welly Teguh) Carleton University Dissertation Engineering Systems and Computer. "Code combining of Reed-Muller codes in an indoor wireless environment." Ottawa, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!