Tell a friend
Print
Matuz, Balazs and Liva, Gianluigi and 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.
This is the latest version of this item.
![[img]](https://elib.dlr.de/style/images/fileicons/application_pdf.png) |
PDF
- Only accessible within DLR
287kB |
Abstract
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.
| Item URL in elib: | https://elib.dlr.de/123885/ | ||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Document Type: | Article | ||||||||||||||||
| Title: | Short Non-Binary Maximum Distance Separable Cycle Codes | ||||||||||||||||
| Authors: |
| ||||||||||||||||
| Date: | March 2018 | ||||||||||||||||
| Journal or Publication Title: | IEEE Communications Letters | ||||||||||||||||
| Refereed publication: | Yes | ||||||||||||||||
| Open Access: | No | ||||||||||||||||
| Gold Open Access: | No | ||||||||||||||||
| In SCOPUS: | Yes | ||||||||||||||||
| In ISI Web of Science: | Yes | ||||||||||||||||
| DOI: | 10.1109/lcomm.2017.2787051 | ||||||||||||||||
| Publisher: | IEEE - Institute of Electrical and Electronics Engineers | ||||||||||||||||
| ISSN: | 1089-7798 | ||||||||||||||||
| Status: | Published | ||||||||||||||||
| Keywords: | Belief propagation, codes on graphs, coherent and non-coherent detection, concatenated codes, cycle codes, lowdensity parity-check codes, maximum distance separable codes. | ||||||||||||||||
| HGF - Research field: | Aeronautics, Space and Transport | ||||||||||||||||
| HGF - Program: | Space | ||||||||||||||||
| HGF - Program Themes: | Communication and Navigation | ||||||||||||||||
| DLR - Research area: | Raumfahrt | ||||||||||||||||
| DLR - Program: | R KN - Kommunikation und Navigation | ||||||||||||||||
| DLR - Research theme (Project): | R - Vorhaben Multimedia Satellitennetze (old) | ||||||||||||||||
| Location: | Oberpfaffenhofen | ||||||||||||||||
| Institutes and Institutions: | Institute of Communication and Navigation > Satellite Networks | ||||||||||||||||
| Deposited By: | Matuz, Balazs | ||||||||||||||||
| Deposited On: | 28 Nov 2018 15:59 | ||||||||||||||||
| Last Modified: | 15 Jun 2023 07:31 |
Available Versions of this Item
-
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) [Currently Displayed]
Repository Staff Only: item control page
