1 resultado para pacs: business applications of it
em DigitalCommons@University of Nebraska - Lincoln
Filtro por publicador
- University of Cagliari UniCA Eprints (1)
- Aberystwyth University Repository - Reino Unido (1)
- Academic Research Repository at Institute of Developing Economies (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (14)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (6)
- Aquatic Commons (6)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (9)
- Archive of European Integration (15)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (4)
- Aston University Research Archive (59)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (19)
- Boston University Digital Common (1)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- Bulgarian Digital Mathematics Library at IMI-BAS (12)
- CaltechTHESIS (11)
- Cambridge University Engineering Department Publications Database (76)
- CentAUR: Central Archive University of Reading - UK (37)
- Center for Jewish History Digital Collections (8)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (37)
- Cochin University of Science & Technology (CUSAT), India (11)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (3)
- CORA - Cork Open Research Archive - University College Cork - Ireland (5)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (3)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (96)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- Digital Commons - Michigan Tech (6)
- Digital Commons - Montana Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (3)
- Digital Peer Publishing (8)
- DigitalCommons@The Texas Medical Center (33)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (3)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (5)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (5)
- Greenwich Academic Literature Archive - UK (4)
- Harvard University (2)
- Helda - Digital Repository of University of Helsinki (11)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (20)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (2)
- Massachusetts Institute of Technology (3)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (7)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (4)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (45)
- Queensland University of Technology - ePrints Archive (58)
- RCAAP - Repositório Científico de Acesso Aberto de Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositorio Institucional de la Universidad de Málaga (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (31)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (3)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- Scientific Open-access Literature Archive and Repository (1)
- Universidad Autónoma de Nuevo León, Mexico (2)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (16)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Montréal, Canada (3)
- University of Canberra Research Repository - Australia (1)
- University of Connecticut - USA (1)
- University of Michigan (163)
- University of Queensland eSpace - Australia (32)
- University of Southampton, United Kingdom (1)
- University of Washington (6)
- USA Library of Congress (2)
- WestminsterResearch - UK (4)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.