Thèses sur le sujet « Coding theory »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Coding theory ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Мельник, Ю. « Coding theory ». Thesis, Видавництво СумДУ, 2006. http://essuir.sumdu.edu.ua/handle/123456789/21790.
Texte intégralЗолотова, Світлана Григорівна, Светлана Григорьевна Золотова, Svitlana Hryhorivna Zolotova et V. V. Petrov. « The history of coding theory ». Thesis, Видавництво СумДУ, 2008. http://essuir.sumdu.edu.ua/handle/123456789/16065.
Texte intégralRyzhikov, Andrew. « Synchronizing automata and coding theory ». Thesis, Paris Est, 2020. http://www.theses.fr/2020PESC2030.
Texte intégralThis thesis is devoted to studying synchronizing words for finite automata and variable-length codes. Intuitively, a synchronizing word is a word such that its application brings a system into some particular state regardless of its initial state. A code or automaton is synchronizing if it admits a synchronizing word. There is a deep connection between the concrete implementations of this notion for finite automata and variable-length codes, and the use of it is one of the leitmotifs of this thesis.One of the main tools for dealing with variable-length codes is assigning a special automaton preserving many synchronization properties to it. For finite codes, this is done using prefix automata.We investigate two fundamental problems about synchronization. The first one is measuring the length of shortest synchronizing words for synchronizing automata and codes. For the case of complete deterministic finite automata, the Černý conjecture, one of the oldest problems in combinatorial automata theory, proposes a quadratic upper bound in terms of the number of states in the automaton. We broaden this conjecture to partial deterministic finite automata and then to unambiguous non-deterministic finite automata. We show polynomial upper bounds for mentioned classes in the presence of strong connectivity, and discuss their connections with the original Černý conjecture.The relation with finite codes allows us to show similar bounds in terms of the sum of the lengths of the codewords, as well as in terms of the length of the longest codeword. The second case is related to another important conjecture stated by Restivo. It deals with mortal words instead of synchronizing ones, the case which we also investigate. For most of these settings we also examine the computational complexity of finding short synchronizing words, which is the second fundamental question investigated in this thesis. Besides that, we study various generalization of the notion of a synchronizing word, which allow to use some partial information about the current state of an automaton. For several such generalizations we show strong computational complexity lower bounds even in very restricted cases
Redwood-Sawyerr, J. A. S. « Constant envelope modulation coding ». Thesis, University of Essex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356049.
Texte intégralCohen, D. A. « A problem in algebraic coding theory ». Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380002.
Texte intégralArslan, Ogul. « Some algebraic problems from coding theory ». [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0024938.
Texte intégralChaiyaboonthanit, Thanit. « Image coding using wavelet transform and adaptive block truncation coding / ». Online version of thesis, 1991. http://hdl.handle.net/1850/10913.
Texte intégralDelopoulos, Athanasios. « Coding techniques for moving images ». Thesis, Imperial College London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338648.
Texte intégralKaouri, Hussein Ali. « Speech coding using vector quantisation ». Thesis, Queen's University Belfast, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356934.
Texte intégralAdistambha, Kevin. « Embedded lossless audio coding using linear prediction and cascade coding ». Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060724.122433/index.html.
Texte intégralWang, Tsang-Yi Varshney Pramod K. « Distributed fault-tolerant classification using coding theory ». Related Electronic Resource : Current Research at SU : database of SU dissertations, recent titles available full text, 2003. http://wwwlib.umi.com/cr/syr/main.
Texte intégralSaleemi, Mehwish [Verfasser]. « Coding Theory via Groebner Bases / Mehwish Saleemi ». München : Verlag Dr. Hut, 2012. http://d-nb.info/1028785445/34.
Texte intégralSchmidt, Natalia [Verfasser]. « Gröbner Bases in Coding Theory / Natalia Schmidt ». München : Verlag Dr. Hut, 2015. http://d-nb.info/1074063236/34.
Texte intégralDunscombe, Elizabeth Jane. « Some applications of mathematics to coding theory ». Thesis, Royal Holloway, University of London, 1988. http://repository.royalholloway.ac.uk/items/a101f1a7-d892-4307-85c4-311c422cdb01/1/.
Texte intégralWhite, Gregory. « Enumeration-based algorithms in linear coding theory ». Phd thesis, Faculty of Science, 2006. http://hdl.handle.net/2123/8084.
Texte intégralAllott, David. « Efficient source coding for digital images ». Thesis, Loughborough University, 1985. https://dspace.lboro.ac.uk/2134/27563.
Texte intégralMcEwen, Peter A. « Trellis coding for partial response channels / ». Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9968170.
Texte intégralCheng, Niann-Tsyr. « Error resilient video coding for noisy channels ». Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239176.
Texte intégralLund, David J. « Reconfigurable channel coding for future communication systems ». Thesis, Lancaster University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289042.
Texte intégralSuddle, Muhammad Riaz. « Speech coding in private and broadcast networks ». Thesis, University of Surrey, 1996. http://epubs.surrey.ac.uk/1019/.
Texte intégralGoh, Kwong Huang. « Wavelet transform based image and video coding ». Thesis, University of Strathclyde, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387720.
Texte intégralLin, Fu-Huei. « Rate-quality based video coding ». Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/14923.
Texte intégralYoshida, Beni. « Studying many-body physics through quantum coding theory ». Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/77257.
Texte intégralThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (p. 133-140).
The emerging closeness between correlated spin systems and error-correcting codes enables us to use coding theoretical techniques to study physical properties of many-body spin systems. This thesis illustrates the use of classical and quantum coding theory in classifying quantum phases arising in many-body spin systems via a systematic study of stabilizer Hamiltonians with translation symmetries. In the first part, we ask what kinds of quantum phases may arise in gapped spin systems on a D-dimensional lattice. We address this condensed matter theoretical question by giving a complete classification of quantum phases arising in stabilizer Hamiltonians at fixed points of RG transformations for D = 1; 2; 3. We found a certain dimensional duality on geometric shapes of logical operators where m-dimensional and (D m)-dimensional logical operators always form anti-commuting pairs (m is an integer). We demonstrate that quantum phases are completely classified by topological characterizations of logical operators where topological quantum phase transitions are driven by non-analytical changes of geometric shapes of logical operators. As a consequence, we argue that topological order is unstable at any nonzero temperature and self-correcting quantum memory in a strict sense may not exist where the memory time is upper bounded by some constant at a fixed temperature, regardless of the system size. Our result also implies that topological field theory is the universal theory for stabilizer Hamiltonians with continuous scale symmetries. In the second part, we ask the fundamental limit on information storage capacity of discrete spin systems. There is a well-known theoretical limit on the amount of information that can be reliably stored in a given volume of discrete spin systems. Yet, previously known systems were far below this theoretical limit. We propose a construction of classical stabilizer Hamiltonians which asymptotically saturate this limit. Our model borrows an idea from fractal geometries arising in the Sierpinski triangle, and is a rare manifestation of limit cycle behaviors with discrete scale symmetries in real-space RG transformations, which may be beyond descriptions of topological field theory.
by Beni Yoshida.
Ph.D.
Kunze, Richard J. « Redundant visual coding of state information / ». free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9841208.
Texte intégralAhmed, Mohammed Zaki. « Crosstalk-resiliant coding for high density digital recording ». Thesis, University of Plymouth, 2003. http://hdl.handle.net/10026.1/2536.
Texte intégralZemouri, Rachid. « Data compression of speech using sub-band coding ». Thesis, University of Newcastle Upon Tyne, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316094.
Texte intégralZhou, Zhi. « Standards conforming video coding optimization / ». Thesis, Connect to this title online ; UW restricted, 2005. http://hdl.handle.net/1773/5984.
Texte intégralBhagwat, Ashwini. « Methodologies and tools for computation offloading on heterogeneous multicores ». Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29688.
Texte intégralCommittee Chair: Pande, Santosh; Committee Member: Clark, Nate; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Cao, Lei. « Error resilient image coding and wireless communications / ». free to MU campus, to others for purchase, 2002. http://wwwlib.umi.com/cr/mo/fullcit?p3052160.
Texte intégralBlasco-Serrano, Ricardo. « Coding Strategies for Compress-and-Forward Relaying ». Licentiate thesis, KTH, Kommunikationsteori, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-26802.
Texte intégralQC 20101206
Neeser, Fredy D. « Communication theory and coding for channels with intersymbol interference / ». Zürich, 1993. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=10314.
Texte intégralLiu, Youjian. « An algebraic space-time coding theory and its applications / ». The Ohio State University, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488204276534358.
Texte intégralCalderini, Marco. « On Boolean functions, symmetric cryptography and algebraic coding theory ». Doctoral thesis, Università degli studi di Trento, 2015. https://hdl.handle.net/11572/369089.
Texte intégralCalderini, Marco. « On Boolean functions, symmetric cryptography and algebraic coding theory ». Doctoral thesis, University of Trento, 2015. http://eprints-phd.biblio.unitn.it/1498/1/template_tesi.pdf.
Texte intégralAlexopoulos, Kyriakos. « Phase spectral representation for low bit rate speech coding ». Thesis, Imperial College London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.249314.
Texte intégralFragiacomo, Simon. « Development in channel coding for error and spectral control ». Thesis, University College London (University of London), 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265072.
Texte intégralEaston, Mark. « Fast algorithms for low bit rate digital speech coding ». Thesis, University of Liverpool, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240500.
Texte intégralKweh, Teck Hock. « Improved quality block-based low bit rate video coding ». Thesis, University of Surrey, 1998. http://epubs.surrey.ac.uk/844563/.
Texte intégralBate, Stephen Donald. « Adaptive coding algorithms for data transmission ». Thesis, Coventry University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.303388.
Texte intégralBayrakeri, Sadik. « Scalable video coding using spatio-temporal interpolation ». Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/15385.
Texte intégralYamazato, Takaya, Iwao Sasase et Shinsaku Mori. « Interlace Coding System Involving Data Compression Code, Data Encryption Code and Error Correcting Code ». IEICE, 1992. http://hdl.handle.net/2237/7844.
Texte intégralYong, Xuerong. « The channel capacity of one and two-dimensional constrained codes / ». View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20YONG.
Texte intégralIncludes bibliographical references (leaves 105-110). Also available in electronic version. Access restricted to campus users.
Pirestani, Shervin. « Source-controlled block turbo coding ». Access to citation, abstract and download form provided by ProQuest Information and Learning Company ; downloadable PDF file, 69 p, 2008. http://proquest.umi.com/pqdlink?did=994238721&sid=2&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Texte intégralLiu, Bin. « Dirty paper coding applications in wireless networks / ». Thesis, Connect to this title online ; UW restricted, 2008. http://hdl.handle.net/1773/5862.
Texte intégralCesbron, Fred́eŕique Chantal. « Multiresolution fractal coding of still images ». Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/15508.
Texte intégralNg, Cheuk-yan, et 吳卓恩. « Rate control algorithms for video coding ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B29729361.
Texte intégralNg, Cheuk-yan. « Rate control algorithms for video coding / ». Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25151289.
Texte intégralLac, Jacquelyn Ha. « Chinese remainder theorem and its applications ». CSUSB ScholarWorks, 2008. https://scholarworks.lib.csusb.edu/etd-project/3373.
Texte intégralAnim-Appiah, Kofi Dankwa. « Interleaved concalenated coding for input-constrained channels ». Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/15363.
Texte intégralWyrwas, Richard R. « Coding for binary image transmission over land mobile radio channels ». Thesis, University of Manchester, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328313.
Texte intégral