Mostra el registre d'ítem simple
Asymptotic MAP upper bounds for LDPC codes
| dc.contributor.author | Matas Navarro, David |
| dc.contributor.author | Lamarca Orozco, M. Meritxell |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions |
| dc.date.accessioned | 2017-01-10T10:49:48Z |
| dc.date.issued | 2016 |
| dc.identifier.citation | Matas, D., Lamarca, M. Asymptotic MAP upper bounds for LDPC codes. A: IEEE International Symposium on Information Theory. "2016 IEEE International Symposium on Information Theory (ISIT 2016): Barcelona, Spain 10-15 July 2016". Barcelona: Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 2893-2897. |
| dc.identifier.isbn | 978-1-5090-1806-2 |
| dc.identifier.uri | http://hdl.handle.net/2117/98937 |
| dc.description | © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| dc.description.abstract | This paper aims at computing tight upper bounds for the maximum a posteriori threshold of low-density parity check codes in the asymptotic blocklength regime for the transmission over binary-input memoryless symmetricoutput channels. While these bounds are already known, we propose a novel derivation based on a completely different approach: based solely on the concept of the chain rule and the conditional entropy, resorting to the concentration theorem for the code ensemble to compute the syndrome entropy with low complexity employing density evolution. |
| dc.format.extent | 5 p. |
| dc.language.iso | eng |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació |
| dc.subject.lcsh | Entropy |
| dc.subject.lcsh | Error-correcting codes (Information theory) |
| dc.subject.other | Maximum likelihood estimation |
| dc.subject.other | Parity check codes |
| dc.subject.other | Asymptotic MAP upper bounds |
| dc.subject.other | LDPC codes |
| dc.subject.other | Maximum a posteriori |
| dc.subject.other | Low-density parity check codes |
| dc.subject.other | Binary-input memoryless symmetric-output channels |
| dc.title | Asymptotic MAP upper bounds for LDPC codes |
| dc.type | Conference report |
| dc.subject.lemac | Entropia |
| dc.subject.lemac | Codis correctors d'errors (Teoria de la informació) |
| dc.contributor.group | Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions |
| dc.identifier.doi | 10.1109/ISIT.2016.7541828 |
| dc.description.peerreviewed | Peer Reviewed |
| dc.rights.access | Open Access |
| local.identifier.drac | 18852184 |
| dc.description.version | Postprint (published version) |
| dc.date.lift | 10000-01-01 |
| local.citation.author | Matas, D.; Lamarca, M. |
| local.citation.contributor | IEEE International Symposium on Information Theory |
| local.citation.pubplace | Barcelona |
| local.citation.publicationName | 2016 IEEE International Symposium on Information Theory (ISIT 2016): Barcelona, Spain 10-15 July 2016 |
| local.citation.startingPage | 2893 |
| local.citation.endingPage | 2897 |
