1 resultado para distribution (probability theory)
em DigitalCommons@University of Nebraska - Lincoln
Filtro por publicador
- Aberdeen University (5)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (1)
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Academic Archive On-line (Stockholm University; Sweden) (2)
- Academic Research Repository at Institute of Developing Economies (1)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (5)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (12)
- Aston University Research Archive (30)
- Biblioteca de Teses e Dissertações da USP (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (24)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (32)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (17)
- Brock University, Canada (2)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (10)
- CaltechTHESIS (11)
- Cambridge University Engineering Department Publications Database (24)
- CentAUR: Central Archive University of Reading - UK (31)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (61)
- Cochin University of Science & Technology (CUSAT), India (7)
- Collection Of Biostatistics Research Archive (5)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (5)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (5)
- Dalarna University College Electronic Archive (11)
- Deakin Research Online - Australia (34)
- Digital Commons - Michigan Tech (3)
- Digital Commons at Florida International University (16)
- 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 (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (10)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (2)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (5)
- Indian Institute of Science - Bangalore - Índia (50)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico de Viseu (1)
- Instituto Politécnico do Porto, Portugal (7)
- Massachusetts Institute of Technology (2)
- National Center for Biotechnology Information - NCBI (12)
- Nottingham eTheses (5)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Portal de Revistas Científicas Complutenses - Espanha (4)
- Publishing Network for Geoscientific & Environmental Data (4)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (42)
- Queensland University of Technology - ePrints Archive (165)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (10)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositorio Institucional de la Universidad de Málaga (2)
- Repositorio Institucional de la Universidad Pública de Navarra - Espanha (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (47)
- Repositorio Institucional Universidad de Medellín (2)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- Universidad de Alicante (7)
- Universidad del Rosario, Colombia (8)
- Universidad Politécnica de Madrid (13)
- Universidade Complutense de Madrid (1)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (1)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (5)
- Universidade Técnica de Lisboa (3)
- Universitat de Girona, Spain (7)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (7)
- Université de Lausanne, Switzerland (2)
- Université de Montréal (2)
- Université de Montréal, Canada (18)
- University of Connecticut - USA (1)
- University of Michigan (23)
- University of Queensland eSpace - Australia (40)
- University of Southampton, United Kingdom (6)
- University of Washington (2)
- WestminsterResearch - 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.