Увійти

Готові списки джерел за темами / Codes minimaux / Дисертації

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Codes minimaux.

Дисертації з теми "Codes minimaux"

Автор: Grafiati

Опубліковано: 22 червня 2024

Оновлено: 19 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 дисертацій для дослідження на тему "Codes minimaux".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Qian, Liqin. "Contributions to the theory of algebraic coding on finite fields and rings and their applications." Electronic Thesis or Diss., Paris 8, 2022. http://www.theses.fr/2022PA080064.

Повний текст джерела

Анотація:

La théorie du codage algébrique sur les corps et les anneaux finis a une grande importance dans la théorie de l'information en raison de leurs diverses applications dans les schémas de partage de secrets, les graphes fortement réguliers, les codes d'authentification et de communication. Cette thèse aborde plusieurs sujets de recherche selon les orientations dans ce contexte, dont les méthodes de construction sont au cœur de nos préoccupations. Plus précisément, nous nous intéressons aux constructions de codes optimaux (ou codes asymptotiquement optimaux), aux constructions de codes linéaires à

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Luu, Tien Duc. "Régularité des cônes et d’ensembles minimaux de dimension 3 dans R4." Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112301/document.

Повний текст джерела

Анотація:

On étudie dans cette thèse la régularité des cônes et d'ensembles de dimension 3 dans l'espace Euclidien de dimension 4.Dans la première partie, on étudie d'abord la régularité Bi-Hölderienne des cônes minimaux de dimension 3 dans l'espace Euclidien de dimension 4. Ceci nous permet ensuite de montrer qu'il existe un difféomorphisme locale entre un cône minimal de dimension 3 dans l'espace Euclidien de dimension 4 et un cône minimal de dimension 3, de type P, Y ou T, loin d'origine. La méthode est la même que pour les ensembles minimaux de dimension 2. On construit des compétiteurs et on se ram

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Miller, John. "High code rate, low-density parity-check codes with guaranteed minimum distance and stopping weight /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3090443.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Fang, Yangqin. "Minimal sets, existence and regularity." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112191/document.

Повний текст джерела

Анотація:

Cette thèse s’intéresse principalement à l’existence et à la régularité desensembles minimaux. On commence par montrer, dans le chapitre 3, que le problème de Plateau étudié par Reifenberg admet au moins une solution. C’est-à-dire que, si l’onse donne un ensemble compact B⊂R^n et un sous-groupe L du groupe d’homologie de Čech H_(d-1) (B;G) de dimension (d-1) sur un groupe abelien G, on montre qu’il existe un ensemble compact E⊃B tel que L est contenu dans le noyau de l’homomorphisme H_(d-1) (B;G)→H_(d-1) (E;G) induit par l’application d’inclusion B→E, et pour lequel la mesure de Hausdorff H^d

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Ketkar, Avanti Ulhas. "Code constructions and code families for nonbinary quantum stabilizer code." Thesis, Texas A&M University, 2004. http://hdl.handle.net/1969.1/2743.

Повний текст джерела

Анотація:

Stabilizer codes form a special class of quantum error correcting codes. Nonbinary quantum stabilizer codes are studied in this thesis. A lot of work on binary quantum stabilizer codes has been done. Nonbinary stabilizer codes have received much less attention. Various results on binary stabilizer codes such as various code families and general code constructions are generalized to the nonbinary case in this thesis. The lower bound on the minimum distance of a code is nothing but the minimum distance of the currently best known code. The focus of this research is to improve the lower bounds on

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Zeng, Fanxuan. "Nonlinear codes: representation, constructions, minimum distance computation and decoding." Doctoral thesis, Universitat Autònoma de Barcelona, 2014. http://hdl.handle.net/10803/284241.

Повний текст джерела

Анотація:

Resum La teoria de codis estudia el disseny de codis correctors d'errors per a la transmisió fidedigne d'informació per un canal amb soroll. Un codi corrector d'errors (o simplement codi) es un proces que consisteix en expressar una seqüència d'elements sobre un alfabet de tal manera que qualsevol error que sigui introduït pot ser detactat i corregit (amb limitacions), i està basat en la tècnica d'afegir elements redundants. Aquest proces inclou la codifcació, la transmisió i la descodifcació de la seqüència d'elements. La majoria dels codis utilitzat són codis bloc i la majoria d'ells tenen

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Cadic, Emmanuel. "Construction de Turbo Codes courts possédant de bonnes propriétés de distance minimale." Limoges, 2003. http://aurore.unilim.fr/theses/nxfile/default/2c131fa5-a15a-4726-8d49-663621bd2daf/blobholder:0/2003LIMO0018.pdf.

Повний текст джерела

Анотація:

L'objectif de cette thèse est de réaliser des turbo codes possédant de bonnes distances minimales et de contribuer ainsi à repousser le phénomène ``d'error floor'' qui correspond à un seuil de l'ordre de 10-6 pour le taux d'erreur résiduelles binaires en dessous duquel la pente de la courbe de TEB diminue de façon significative. Ce problème s'est sensiblement amélioré avec l'apparition des codes duo-binaires de Berrou [11] qui permettent notamment d'obtenir de meilleures distances minimales. Pour obtenir de bonnes distances minimales avec des turbo codes courts (longueur inférieure à 512), la

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Siap, Irfan. "Generalized [Gamma]-fold weight enumerators for linear codes and new linear codes with improved minimum distances /." The Ohio State University, 2000. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488193272067477.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Kumar, Santosh. "Upper bounds on minimum distance of nonbinary quantum stabilizer codes." Thesis, Texas A&M University, 2004. http://hdl.handle.net/1969.1/2744.

Повний текст джерела

Анотація:

The most popular class of quantum error correcting codes is stabilizer codes. Binary quantum stabilizer codes have been well studied, and Calderbank, Rains, Shor and Sloane (July 1998) have constructed a table of upper bounds on the minimum distance of these codes using linear programming methods. However, not much is known in the case of nonbinary stabilizer codes. In this thesis, we establish a bridge between selforthogonal classical codes over the ﬁnite ﬁeld containing q2 elements and quantum codes, extending and unifying previous work by Matsumoto and Uyematsu (2000), Ashikhmin and Knill (

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Chan, Evelyn Yu-San. "Heuristic optimisation for the minimum distance problem." Thesis, Nottingham Trent University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324569.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

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.

Повний текст джерела

Анотація:

<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 mi

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Cavallotto, Edoardo. "Résultats de régularité et d'existence pour des ensembles minimaux ; Problème de Plateau." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS180/document.

Повний текст джерела

Анотація:

Résoudre le Problème de Plateau signifie trouver la surface ayant l’aire minimale parmi toutes les surfaces avec un bord donné.Une partie du problème réside dans le fait de donner des définitions appropriées aux concepts de “surface”, “aire” et “bord”. Dans notre contexte les objets considérés sont ensembles dont la mesure de Hausdorff est localement finie. La condition de bord glissant est donnée par rapport à une famille à un paramètre de déformations compactes laquelle permet au bord de glisser le long d'un ensemble fermé. La fonctionnelle à minimiser est liée aux problèmes de capillarité e

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Wunderlich, Marcel [Verfasser], and Boris [Akademischer Betreuer] Vertman. "Mean curvature flow of cones near minimal cones / Marcel Wunderlich ; Betreuer: Boris Vertman." Münster : Universitäts- und Landesbibliothek Münster, 2019. http://d-nb.info/1190175517/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Papadimitriou, Panayiotis D. "Code design based on metric-spectrum and applications." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1365.

Повний текст джерела

Анотація:

We introduced nested search methods to design (n, k) block codes for arbitrary channels by optimizing an appropriate metric spectrum in each iteration. For a given k, the methods start with a good high rate code, say k/(k + 1), and successively design lower rate codes up to rate k/2^k corresponding to a Hadamard code. Using a full search for small binary codes we found that optimal or near-optimal codes of increasing length can be obtained in a nested manner by utilizing Hadamard matrix columns. The codes can be linear if the Hadamard matrix is linear and non-linear otherwise. The design metho

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Bazzi, Louay Mohamad Jamil 1974. "Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/17042.

Повний текст джерела

Анотація:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.<br>Includes bibliographical references (leaves 207-214).<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>We study the minimum distance of binary error correcting codes from the following perspectives: * The problem of deriving bounds on the minimum distance of a code given constraints on the computational complexity of its encoder. * The minimum distance of linear codes that a

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Fingeret, Samuel (Samuel P. ). "Defeating code reuse attacks with minimal tagged architecture." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/105986.

Повний текст джерела

Анотація:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<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 student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 93-97).<br>In this thesis, we argue that software-based defenses to code reuse attacks are fundamentally flawed. With code pointer integrity as a case study, we show that a secure and efficient software-based defense to code

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Nikolaidis, Christos. "On binary linear codes with 2-transitive automorphism group and minimum weight four." Thesis, University of Oxford, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318832.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

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

Повний текст джерела

Анотація:

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 та ін.

19

Appleby, Paul [Verfasser]. "Mean curvature flow of surfaces asymptotic to minimal cones / Paul Appleby." Berlin : Freie Universität Berlin, 2011. http://d-nb.info/1025510003/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Galand, Fabien. "Construction de codes Z indice p à la puissance k linéaires de bonne distance minimale et schémas de dissimulation fondés sur les codes de recouvrement." Caen, 2004. http://www.theses.fr/2004CAEN2047.

Повний текст джерела

Анотація:

Cette thèse étudie deux axes de recherches reposant sur les codes. Chaque axe porte sur un paramètre particulier. Le premier axe est celui de la correction d'erreur, et nous nous intéressons à la distance minimale des codes. Notre objectif est de construire des codes sur Fp ayant une bonne distance minimale. Pour cela nous utilisons conjointement le relèvement de Hensel et la Zpk-linéarité. Nous donnons la distance minimale en petite longueur d'une généralisation des codes de Kerdock et de Preparata, ainsi que des relevés des codes de résidus quadratiques. Parmi ces codes, nous en obtenons qua

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Mahmudi, Ali. "The investigation into generic VHDL implementation of generalised minimum distance decoding for Reed Solomon codes." Thesis, University of Huddersfield, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417302.

Повний текст джерела

Анотація:

This thesis is concerned with the hardware implementation in VHDL (VHSIC Hardware Description Language) of a Generalised Minimum Distance (GMD) decoder for Reed Solomon (RS) codes. The generic GMD decoder has been implemented for the Reed Solomon codes over GF(28 ). It works for a number of RS codes: RS(255, 239), RS(255, 241), RS(255, 243), RS(255, 245), RS(255, 247), RS(255, 249), and RS(255, 251). As a comparison, a Hard Decision Decoder (HDD) using the Welch-Berlekamp algorithm for the same RS codes is also implemented. The designs were first implemented in MAT LAB. Then, the designs were

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Assuena, Samir. "Códigos metacíclicos." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-30102013-065155/.

Повний текст джерела

Анотація:

Neste trabalho, consideramos álgebras de grupo semissimples F_G de grupos metacíclicos não abelianos que cindem sobre corpos finitos. Inicialmente, damos condições para que o número de componentes simples da álgebra F_G seja minimal e encontramos os idempotentes centrais primitivos quando a ordem do grupo é igual a p^l^, onde p e l são números primos distintos. Posteriormente, obtemos condições necessárias e suficientes para que o número de componentes simples da álgebra F_G seja minimal no caso em que a ordem do grupo é igual a 2n. Finalmente, quando G=D_{p^}, o grupo diedral

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Corazza, Federico Augusto. "Analysis of graph-based quantum error-correcting codes." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23801/.

Повний текст джерела

Анотація:

With the advent of quantum computers, there has been a growing interest in the practicality of this device. Due to the delicate conditions that surround physical qubits, one could wonder whether any useful computation could be implemented on such devices. As we describe in this work, it is possible to exploit concepts from classical information theory and employ quantum error-correcting techniques. Thanks to the Threshold Theorem, if the error probability of physical qubits is below a given threshold, then the logical error probability corresponding to the encoded data qubit can be arbitrarily

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Fang, Juing. "Décodage pondère des codes en blocs et quelques sujets sur la complexité du décodage." Paris, ENST, 1987. http://www.theses.fr/1987ENST0005.

Повний текст джерела

Анотація:

Etude de la compléxité théorique du décodage des codes en blocs à travers une famille d'algorithmes basée sur le principe d'optimisation combinatoire. Puis on aborde un algorithme parallèle de décodage algébrique dont la complexitré est liée au niveau de bruit du canal. Enfin on introduit un algorithme de Viterbi pour les applications de traitement en chaînes.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Assis, Ailton Ribeiro de. "Idempotentes em Álgebras de Grupos e Códigos Abelianos Minimais." Universidade Federal da Paraíba, 2011. http://tede.biblioteca.ufpb.br:8080/handle/tede/7401.

Повний текст джерела

Анотація:

Made available in DSpace on 2015-05-15T11:46:11Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 411324 bytes, checksum: 65de8bf46cc2dff58911edbcb15868ca (MD5) Previous issue date: 2011-09-09<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>In this work, we study the semisimple group algebras FqCn of the finite abelian groups Cn over a finite field Fq and give conditions so that the number of its simple components is minimal; i.e. equal to the number of simple components of the rational group algebra of the same group. Under such conditions, we compute the set of primitive ide

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Augot, Daniel. "Étude algèbrique des mots de poids minimum des codes cycliques, méthodes d'algèbre linéaire sur les corps finis." Phd thesis, Université Pierre et Marie Curie - Paris VI, 1993. http://tel.archives-ouvertes.fr/tel-00723227.

Повний текст джерела

Анотація:

Nous étudions les mots de poids minimal des codes correcteurs d'erreurs cycliques. Les fonctions symétriques élémentaires et les fonctions puissances des localisateurs de ces mots vérifient les identités de Newton. Dans le premier chapitre celles-ci sont étudiées comme un système d'équations algébriques, dont les solutions sont étudiées par transformation de Fourier. Dans le chapitre II, le lien est fait avec les codes correcteurs d'erreurs cycliques. Sur quelques exemples, il est montré comment étudier les mots de poids minimal sur la donnée d'une base standard de l'idéal engendré par les équ

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Augot, Daniel. "Etude algebrique des mots de poids minimum des codes cycliques, methodes d'algebre lineaire sur les corps finis." Paris 6, 1993. https://tel.archives-ouvertes.fr/tel-00723227.

Повний текст джерела

Анотація:

Nous etudions les mots de poids minimal des codes correcteurs d'erreurs cycliques. Les fonctions symetriques elementaires et les fonctions puissances des localisateurs de ces mots verifient les identites de newton. Dans le premier chapitre celles-ci sont etudiees comme un systeme d'equations algebriques, dont les solutions sont etudiees par transformation de fourier. Dans le chapitre ii, le lien est fait avec les codes correcteurs d'erreurs cycliques. Sur quelques exemples, il est montre comment etudier les mots de poids minimal sur la donnee d'une base standard de l'ideal engendre par les equ

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Al-Fahad, Jasem Y. "Reform of building codes, regulations, administration and enforcement in Kuwait : within the legal, administrative, technical & social framework." Thesis, Loughborough University, 2012. https://dspace.lboro.ac.uk/2134/9883.

Повний текст джерела

Анотація:

The majority of building code development and implementation practices are normally connected with the progress of construction community changing awareness, needs and perspectives, advanced technology in construction and new level of knowledge. Unproven practices and the technology of building code development and implementation in case of insufficient and outdated codes, the use of unproven advanced codes of other countries, or the infringement of the existing codes, in most cases, could lead to a large number of shortcomings of minimum requirements of public health, safety and general welfa

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Abdallah, Saeed. "Widely linear minimum variance channel estimation with application to multicarrier CDMA systems." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=112550.

Повний текст джерела

Анотація:

Conventional Minimum-Variance (MV) channel estimation is affected by two sources of error, namely the finite number of samples used to estimate the covariance matrix and the asymptotic bias due to interference and additive noise. On the other hand, widely linear (WL) filtering has been shown to improve the estimation of improper complex signals. Researchers have recently demonstrated that the application of WL processing principles can significantly improve the performance of subspace-based channel estimation algorithms. However, in contrast to MV estimation algorithms, subspace-based algorith

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Zeh, Alexander. "Algebraic Soft- and Hard-Decision Decoding of Generalized Reed--Solomon and Cyclic Codes." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00866134.

Повний текст джерела

Анотація:

Deux défis de la théorie du codage algébrique sont traités dans cette thèse. Le premier est le décodage efficace (dur et souple) de codes de Reed--Solomon généralisés sur les corps finis en métrique de Hamming. La motivation pour résoudre ce problème vieux de plus de 50 ans a été renouvelée par la découverte par Guruswami et Sudan à la fin du 20ème siècle d'un algorithme polynomial de décodage jusqu'au rayon Johnson basé sur l'interpolation. Les premières méthodes de décodage algébrique des codes de Reed--Solomon généralisés faisaient appel à une équation clé, c'est à dire, une description pol

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Dang, Xiaoyu. "An Optimum Detector for Space-Time Trellis Coded Differential MSK." International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604515.

Повний текст джерела

Анотація:

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada<br>The accuracy of channel estimation plays a crucial role in the demodulation of data symbols sent across an unknown wireless medium. In this work a new analytical expression for the channel estimation error of a multiple input multiple output (MIMO) system is obtained when the wireless medium is continuously changing in the temporal domain. Numerical examples are provided to illustrate our find

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Triantafillou, Thanasis C. (Thanasis Christos). "Failure mode maps and minimum weight design for structural sandwich beams with rigid foam cores." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14944.

Повний текст джерела

Анотація:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1987.<br>MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.<br>Bibliography: leaves 69-71.<br>by Thanasis C. Triantafillou.<br>M.S.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Merlino, Enzo Maria. "Fractional Perimeter and Nonlocal Minimal Surfaces." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Знайти повний текст джерела

Анотація:

This work aims to present a study of the principal results about the fractional perimeter and the regularity theory of nonlocal minimal surfaces. The fractional perimeter is a variation of the classical notion of Caccioppoli perimeter, recently introduced by L. Caffarelli, J.-M. Roquejoffre and O. Savin, that takes into account also long-range point-wise interactions between sets, modulated by a kernel with polynomial decay. That type of nonlocal minimal surfaces arises naturally, for instance, in the study of fractals and phase transitions models. First of all, we de�fine the fractional perim

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Garcia, Vitor Araujo. "Idempotentes centrais primitivos em algumas álgebras de grupos." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-05102015-225032/.

Повний текст джерела

Анотація:

O objetivo do trabalho é apresentar alguns resultados acerca de anéis de grupos e aplicações, segundo o que foi estudado em livros e artigos sobre o assunto. Inicialmente, apresentaremos alguns fatos básicos sobre anéis de grupos, que podem ser encontrados em [5], e em seguida, apresentaremos os resultados principais, mais recentes, que foram estudados em dois artigos diferentes. No primeiro artigo [4], apresentou-se uma forma de calcular o número de componentes simples de certas álgebras de grupos abelianos finitos, bem como também foi apresentada uma forma de calcular geradores idempotentes

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Su, Yong. "Mathematical modeling with applications in high-performance coding." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1127139848.

Повний текст джерела

Анотація:

Thesis (Ph. D.)--Ohio State University, 2005.<br>Title from first page of PDF file. Document formatted into pages; contains xiv, 130 p.; also includes graphics (some col.). Includes bibliographical references (p. 125-130). Available online via OhioLINK's ETD Center

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Garcia-Alis, Daniel. "On adaptive MMSE receiver strategies for TD-CDMA." Thesis, University of Strathclyde, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366896.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Sepúlveda, Castellanos Alonso. "Sobre codigos hermitianos generalizados." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307073.

Повний текст джерела

Анотація:

Orientador: Fernando Eduardo Torres Orihuela<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica<br>Made available in DSpace on 2018-08-10T07:01:07Z (GMT). No. of bitstreams: 1 SepulvedaCastellanos_Alonso_D.pdf: 783003 bytes, checksum: 2af4bba938cd5b7d31fcd02a5c79ac85 (MD5) Previous issue date: 2008<br>Resumo: Estudamos os códigos de Goppa (códigos GH) sobre certos corpos de funções algébricas com muitos lugares racionais. Estes códigos generalizam os bem conhecidos códigos Hermitianos; portanto podemos esperar que estes códig

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Karaer, Arzu. "Optimum bit-by-bit power allocation for minimum distortion transmission." Texas A&M University, 2005. http://hdl.handle.net/1969.1/4760.

Повний текст джерела

Анотація:

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 significan

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Moro, Eliton Mendonça [UNESP]. "Códigos de bloco espaço-temporais via corpos quadráticos." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/148757.

Повний текст джерела

Анотація:

Submitted by Eliton Mendonça Moro null (elitonmoro@hotmail.com) on 2017-02-07T16:23:35Z No. of bitstreams: 1 Dissert Moro E M.pdf: 1346120 bytes, checksum: fb365a8ed97b3769301b908d77114d7c (MD5)<br>Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-02-13T16:33:25Z (GMT) No. of bitstreams: 1 moro_em_me_sjrp.pdf: 1346120 bytes, checksum: fb365a8ed97b3769301b908d77114d7c (MD5)<br>Made available in DSpace on 2017-02-13T16:33:25Z (GMT). No. of bitstreams: 1 moro_em_me_sjrp.pdf: 1346120 bytes, checksum: fb365a8ed97b3769301b908d77114d7c (MD5)

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Ghayour, Mehdi. "Enhancements to the sample-matrix-inversion based minimum- variance-distortionless-response detectors in code-division- multiple-access systems." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18464.

Повний текст джерела

Анотація:

Alternative methods to minimum-variance distortionless-response (MVDR) detection under small data records in code-division multiple-access binary phase-shift keying systems are explored. A comprehensive review of the conventional and optimal detectors as well as the principal component, cross-spectral and auxiliary vector (AV) methods are presented. The concept of widely linear (WL) filtering is introduced. Two different versions of the WL MVDR filters are proved to be equivalent; implementing the WL MVDR detector using the AV structure is proposed and shown to provide significant performance

Стилі APA, Harvard, Vancouver, ISO та ін.

41

SILVA, JORGE KENEDY ALMEIDA. "TECHNICAL REGULATION: PROPOSITION OF A MINIMUM CODE OF THE GOOD REGULATORY PRACTICES AND DIAGNOSIS OF THE BRAZILIAN SYSTEM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2007. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9964@1.

Повний текст джерела

Анотація:

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Objetivo: Proposição de um código mínimo das boas práticas da regulamentação técnica com vistas a disciplinar o desenvolvimento e a aplicação de regulamentos e assegurar que estes somente sejam introduzidos quando justificados com base em objetivos legítimos e em benefício da eficiência de qualquer sistema regulatório, com o propósito de evitar barreiras desnecessárias ao comércio e sem prejuízo dos interesses públicos. Motivação: Contribuir para o avanço do conhecimento sobre regulamentação técnica e para o aprimoramento

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Bezerra, Kelton Silva. "Rigidity and unstability of hypersurfaces and an unicity theorem on semi-Rieamannian manifolds." Universidade Federal do CearÃ, 2013. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=16530.

Повний текст джерела

Анотація:

CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel Superior<br>Our aim in this work is threefold. First, we get an extension, to the spherical case, of a theorem due to J. Simons, which concerns unstability of minimal cones constructed over a certain class of minimal submanifolds of the Euclidean sphere. Second, we classify the quasi-Einstein structures of the Riemannian product Hn x R. Third, we get a rigidity theorem for complete hypersurfaces into the De Sitter space, under certain conditions on the mean and scalar curvatures.<br>Este trabalho aborda trÃs problemas em Geometria Diferencial.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Beirami, Ahmad. "Characterizing the redundancy of universal source coding for finite-length sequences." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/45750.

Повний текст джерела

Анотація:

In this thesis, we first study what is the average redundancy resulting from the universal compression of a single finite-length sequence from an unknown source. In the universal compression of a source with d unknown parameters, Rissanen demonstrated that the expected redundancy for regular codes is asymptotically d/2 log n + o(log n) for almost all sources, where n is the sequence length. Clarke and Barron also derived the asymptotic average minimax redundancy for memoryless sources. The average minimax redundancy is concerned with the redundancy of the worst parameter vector for the best co

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Irmer, Ralf. "Multiuser Transmission in Code Division Multiple Access Mobile Communications Systems." Doctoral thesis, Aachen : Shaker, 2005. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=013194664&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Irmer, Ralf. "Multiuser Transmission in Code Division Multiple Access Mobile Communications Systems." Doctoral thesis, Technische Universität Dresden, 2004. https://tud.qucosa.de/id/qucosa%3A24546.

Повний текст джерела

Анотація:

Code Division Multiple Access (CDMA) is the technology used in all third generation cellular communications networks, and it is a promising candidate for the definition of fourth generation standards. The wireless mobile channel is usually frequency-selective causing interference among the users in one CDMA cell. Multiuser Transmission (MUT) algorithms for the downlink can increase the number of supportable users per cell, or decrease the necessary transmit power to guarantee a certain quality-of-service. Transmitter-based algorithms exploiting the channel knowledge in the transmitter are also

Стилі APA, Harvard, Vancouver, ISO та ін.

46

David, Vincent. "Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint : étude et application au minimax." Toulouse, ENSAE, 1993. http://www.theses.fr/1993ESAE0008.

Повний текст джерела

Анотація:

Cette thèse présente un modèle de traitement parallèle pour la mise en œuvre d'algorithmes de raisonnement dans le cadre d'un système temps-réel intelligent, et s'inscrit dans l'étude SATURNE menée au CERT-ONERA. Ce projet se fonde sur l'hypothèse que les tâches de traitement ont la capacité de s'adapter aux échéances temporelles. Pour satisfaire ce modèle, les solutions proposées sont la réduction de l'espace de recherche et l'accélération des traitements grâce au parallélisme. Ces changements devant intervenir durant l'exécution du processus, la gestion du parallélisme devient alors dynamiqu

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Á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.

Повний текст джерела

Анотація:

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 generaliz

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Bernon, Jérémy. "Caractérisation du secteur de Higgs et aspects du problème de la saveur." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAY020/document.

Повний текст джерела

Анотація:

Le Modèle Standard (MS) de la physique des particules s’est imposé comme étant la description la plus précise des interactions fondamentales entre les particules élémentaires. La découverte d’un boson de Higgs, avec une masse de 125 GeV, en Juillet 2012 au Large Hadron Collider (LHC), en a marqué sa confirmation définitive. Cependant, de nombreux problèmes observationnels et théoriques sont au coeur du MS, la plupart liés au secteur de Higgs. Etant une particule scalaire, le boson de Higgs souffre de très grandes corrections radiatives, ce qui déstabilise l’échelle électro-faible et mène au pr

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Oliveira, Fabrício Alves. "Códigos parametrizados afins." Universidade Federal de Uberlândia, 2014. https://repositorio.ufu.br/handle/123456789/16809.

Повний текст джерела

Анотація:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>In this work, we present a special class of linear codes: parameterized affine codes. We show that these codes are easy to construct and that given a parameterized affine code one can easily obtain an equivalent projective parameterized code equivalent to it. We also studied some topics which served as the theoretical foundations for the work, such as the theory of Groebner Bases, the footprint of an ideal and some topics of algebraic geometry and commutative algebra. This work has as main goal to obtain the basic parameters (lengt

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Marachli, Alaa. "Sur la stabilité de certaines surfaces minimales sous le flot de courbure moyenne nulle dans l'espace de Minkowski." Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC0034.

Повний текст джерела

Анотація:

Cette thèse porte sur la question de stabilité de certaines surfaces minimales évoluant sous le flot de courbure moyenne nulle dans l'espace de Minkowski. Cette problématique conduit à l'étude d'un système d'équations qui s'avère d'être hyperbolique sous la condition que les surfaces en question restent de type temps.Le travail qu'on présente ici se compose de deux parties. La première partie est liée à la formation de singularités en temps fini pour des surfaces asymptotiques au cône de Simons à l'infini et la seconde partie est consacrée à la stabilité de l'hélicoïde.Dans la première partie

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!