1 resultado para Decoding principle
em CaltechTHESIS
Filtro por publicador
- Repository Napier (1)
- Aberystwyth University Repository - Reino Unido (4)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (3)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- Aquatic Commons (4)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (29)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Aston University Research Archive (19)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (22)
- Boston University Digital Common (1)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (69)
- CentAUR: Central Archive University of Reading - UK (21)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (25)
- Cochin University of Science & Technology (CUSAT), India (1)
- Coffee Science - Universidade Federal de Lavras (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (15)
- CORA - Cork Open Research Archive - University College Cork - Ireland (4)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (5)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (37)
- Digital Commons - Michigan Tech (1)
- Digital Commons - Montana Tech (1)
- Digital Commons at Florida International University (4)
- Digital Howard @ Howard University | Howard University Research (1)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (2)
- Duke University (2)
- Helda - Digital Repository of University of Helsinki (1)
- Indian Institute of Science - Bangalore - Índia (57)
- Institutional Repository of Leibniz University Hannover (2)
- Instituto Politécnico do Porto, Portugal (1)
- Massachusetts Institute of Technology (2)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (8)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- 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 (39)
- Queensland University of Technology - ePrints Archive (341)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (46)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (8)
- Universidade Complutense de Madrid (1)
- Universita di Parma (1)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (2)
- Université de Montréal (1)
- Université de Montréal, Canada (8)
- Université Laval Mémoires et thèses électroniques (1)
- University of Michigan (78)
- University of Queensland eSpace - Australia (17)
- University of Southampton, United Kingdom (1)
- University of Washington (2)
- WestminsterResearch - UK (4)
Resumo:
Proper encoding of transmitted information can improve the performance of a communication system. To recover the information at the receiver it is necessary to decode the received signal. For many codes the complexity and slowness of the decoder is so severe that the code is not feasible for practical use. This thesis considers the decoding problem for one such class of codes, the comma-free codes related to the first-order Reed-Muller codes.
A factorization of the code matrix is found which leads to a simple, fast, minimum memory, decoder. The decoder is modular and only n modules are needed to decode a code of length 2n. The relevant factorization is extended to any code defined by a sequence of Kronecker products.
The problem of monitoring the correct synchronization position is also considered. A general answer seems to depend upon more detailed knowledge of the structure of comma-free codes. However, a technique is presented which gives useful results in many specific cases.