1 resultado para Semigroups of linear operators
em DigitalCommons@University of Nebraska - Lincoln
Filtro por publicador
- Aberdeen University (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 (11)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (8)
- ARCA - Repositório Institucional da FIOCRUZ (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (18)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Aston University Research Archive (36)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (16)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (71)
- Biblioteca Virtual del Sistema Sanitario Público de Andalucía (BV-SSPA), Junta de Andalucía. Consejería de Salud y Bienestar Social, Spain (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (16)
- Brock University, Canada (3)
- Brunel University (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (40)
- CentAUR: Central Archive University of Reading - UK (84)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (2)
- Cochin University of Science & Technology (CUSAT), India (15)
- Coffee Science - Universidade Federal de Lavras (3)
- Collection Of Biostatistics Research Archive (4)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (4)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (64)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (5)
- CUNY Academic Works (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (3)
- Digital Commons - Montana Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (4)
- DigitalCommons - The University of Maine Research (2)
- DigitalCommons@The Texas Medical Center (3)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (36)
- Greenwich Academic Literature Archive - UK (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (23)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (4)
- National Center for Biotechnology Information - NCBI (8)
- Publishing Network for Geoscientific & Environmental Data (3)
- QSpace: Queen's University - Canada (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (7)
- Repositório Aberto da Universidade Aberta de Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (21)
- Repositório da Produção Científica e Intelectual da Unicamp (5)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (2)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (1)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (103)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (17)
- Scielo Saúde Pública - SP (17)
- Scielo Uruguai (1)
- Universidad de Alicante (8)
- Universidad del Rosario, Colombia (8)
- Universidad Politécnica de Madrid (25)
- Universidade Complutense de Madrid (6)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade de Madeira (1)
- Universidade do Minho (7)
- Universidade dos Açores - Portugal (1)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universidade Técnica de Lisboa (1)
- Universitat de Girona, Spain (7)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (10)
- Université de Lausanne, Switzerland (21)
- Université de Montréal, Canada (15)
- Université Laval Mémoires et thèses électroniques (1)
- University of Connecticut - USA (1)
- University of Michigan (13)
- University of Queensland eSpace - Australia (41)
- University of Southampton, United Kingdom (45)
- University of Washington (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.