Versenden
Drucken
Matuz, Balazs und Liva, Gianluigi und Paolini, Enrico (2018) Short Non-Binary Maximum Distance Separable Cycle Codes. IEEE Communications Letters. IEEE - Institute of Electrical and Electronics Engineers. doi: 10.1109/lcomm.2017.2787051. ISSN 1089-7798.
Dies ist die aktuellste Version dieses Eintrags.
![[img]](https://elib.dlr.de/style/images/fileicons/application_pdf.png) |
PDF
- Nur DLR-intern zugänglich
287kB |
Kurzfassung
This letter presents a class of very short non-binary cycle codes that are maximum distance separable (MDS). It is proved that there is one and only one regular graph on which MDS cycle codes may be constructed, and only for finite field orders larger than or equal to 5. An explicit construction method is described to generate MDS cycle codes based on the identified graph, for any admissible field order. The proposed codes admit efficient soft-decision decoding based on belief-propagation, with small performance losses with respect to optimum maximumlikelihood decoding. When concatenated with an inner binary code, they yield short binary codes with low code rates representing a practical and effective solution for the protection of short messages, for example, of critical packet headers in wireless communication systems.
| elib-URL des Eintrags: | https://elib.dlr.de/123885/ | ||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dokumentart: | Zeitschriftenbeitrag | ||||||||||||||||
| Titel: | Short Non-Binary Maximum Distance Separable Cycle Codes | ||||||||||||||||
| Autoren: |
| ||||||||||||||||
| Datum: | März 2018 | ||||||||||||||||
| Erschienen in: | IEEE Communications Letters | ||||||||||||||||
| Referierte Publikation: | Ja | ||||||||||||||||
| Open Access: | Nein | ||||||||||||||||
| Gold Open Access: | Nein | ||||||||||||||||
| In SCOPUS: | Ja | ||||||||||||||||
| In ISI Web of Science: | Ja | ||||||||||||||||
| DOI: | 10.1109/lcomm.2017.2787051 | ||||||||||||||||
| Verlag: | IEEE - Institute of Electrical and Electronics Engineers | ||||||||||||||||
| ISSN: | 1089-7798 | ||||||||||||||||
| Status: | veröffentlicht | ||||||||||||||||
| Stichwörter: | Belief propagation, codes on graphs, coherent and non-coherent detection, concatenated codes, cycle codes, lowdensity parity-check codes, maximum distance separable codes. | ||||||||||||||||
| HGF - Forschungsbereich: | Luftfahrt, Raumfahrt und Verkehr | ||||||||||||||||
| HGF - Programm: | Raumfahrt | ||||||||||||||||
| HGF - Programmthema: | Kommunikation und Navigation | ||||||||||||||||
| DLR - Schwerpunkt: | Raumfahrt | ||||||||||||||||
| DLR - Forschungsgebiet: | R KN - Kommunikation und Navigation | ||||||||||||||||
| DLR - Teilgebiet (Projekt, Vorhaben): | R - Vorhaben Multimedia Satellitennetze (alt) | ||||||||||||||||
| Standort: | Oberpfaffenhofen | ||||||||||||||||
| Institute & Einrichtungen: | Institut für Kommunikation und Navigation > Satellitennetze | ||||||||||||||||
| Hinterlegt von: | Matuz, Balazs | ||||||||||||||||
| Hinterlegt am: | 28 Nov 2018 15:59 | ||||||||||||||||
| Letzte Änderung: | 15 Jun 2023 07:31 |
Verfügbare Versionen dieses Eintrags
-
Short Non-Binary Maximum Distance Separable Cycle Codes. (deposited 08 Feb 2018 14:20)
- Short Non-Binary Maximum Distance Separable Cycle Codes. (deposited 28 Nov 2018 15:59) [Gegenwärtig angezeigt]
Nur für Mitarbeiter des Archivs: Kontrollseite des Eintrags
