Special Issue "Coding Theory and Its Application"

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 July 2019).

Special Issue Editors

Guest Editor
Dr. Gianluigi Liva Website E-Mail
Institute of Communication and Navigation, German Aerospace Center (DLR), Wessling 82234, Germany
Interests: error-correcting codes and their application to security; communication systems; and data storage
Guest Editor
Prof. Alexandre Graell i Amat Website E-Mail
Department of Electrical Engineering, Chalmers University of Technology, Gothenburg 41296, Sweden
Interests: (modern) coding theory and its application to distributed storage and computing, privacy, and optical communications
Guest Editor
Prof. Antonia Wachter-Zeh Website E-Mail
Institute for Communications Engineering, Technical University of Munich, Munich 80333, Germany
Interests: error-correcting codes and their application to security; communication systems; and data storage

Special Issue Information

Dear Colleagues,

We are glad to announce the upcoming Special Issue dedicated to coding theory and its applications. This Special Issue aims to provide a unified, comprehensive view of recent advances in channel coding in the context of a broad range of both well-established and emerging applications. While historically tightly related to the problem of protecting communication links, channel codes offer solutions to a large class of challenges, spanning from the efficient storage of information over distributed network nodes to quantum computer attack-resilient encryption algorithms, protocol design for high-throughput uncoordinated medium access control, DNA storage, speeding up distributed computing tasks, and secret key generation—just to mention a few.

Researchers active in the analysis, design, and application of schemes based on channel codes are highly encouraged to submit their recent original findings. 

Dr. Gianluigi Liva
Prof. Alexandre Graell i Amat
Prof. Antonia Wachter-Zeh
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1000 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Error correcting codes for high throughput communication systems
  • Error correcting codes for machine-type communications
  • Coding for storage
  • Code-based cryptosystems
  • Coding for multi-user communications
  • Coding for secrecy and privacy
  • Application of coding techniques to compressive sensing and group testing
  • Coding for distributed computing
  • Coding for optical communications

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Open AccessArticle
Coarsely Quantized Decoding and Construction of Polar Codes Using the Information Bottleneck Method
Algorithms 2019, 12(9), 192; https://doi.org/10.3390/a12090192 - 10 Sep 2019
Abstract
The information bottleneck method is a generic clustering framework from the field of machine learning which allows compressing an observed quantity while retaining as much of the mutual information it shares with the quantity of primary relevance as possible. The framework was recently [...] Read more.
The information bottleneck method is a generic clustering framework from the field of machine learning which allows compressing an observed quantity while retaining as much of the mutual information it shares with the quantity of primary relevance as possible. The framework was recently used to design message-passing decoders for low-density parity-check codes in which all the arithmetic operations on log-likelihood ratios are replaced by table lookups of unsigned integers. This paper presents, in detail, the application of the information bottleneck method to polar codes, where the framework is used to compress the virtual bit channels defined in the code structure and show that the benefits are twofold. On the one hand, the compression restricts the output alphabet of the bit channels to a manageable size. This facilitates computing the capacities of the bit channels in order to identify the ones with larger capacities. On the other hand, the intermediate steps of the compression process can be used to replace the log-likelihood ratio computations in the decoder with table lookups of unsigned integers. Hence, a single procedure produces a polar encoder as well as its tailored, quantized decoder. Moreover, we also use a technique called message alignment to reduce the space complexity of the quantized decoder obtained using the information bottleneck framework. Full article
(This article belongs to the Special Issue Coding Theory and Its Application)
Show Figures

Figure 1

Open AccessArticle
Protograph LDPC Code Design for Asynchronous Random Access
Algorithms 2019, 12(8), 170; https://doi.org/10.3390/a12080170 - 15 Aug 2019
Abstract
This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define a surrogate channel model and propose different protograph low-density [...] Read more.
This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define a surrogate channel model and propose different protograph low-density parity-check code designs. The proposed codes are both tested in a setup where the physical layer is abstracted, as well as on a more realistic channel model, where finite-length physical layer simulations of the entire asynchronous random access scheme, including decoding, are carried out. We find that the abstracted physical layer model overestimates the performance when short blocks are considered. Additionally, the optimized codes show gains in supported channel traffic, a measure of the number of terminals that can be concurrently accommodated on the channel, of around 17% at a packet loss rate of 10 2 w.r.t. off-the-shelf codes. Full article
(This article belongs to the Special Issue Coding Theory and Its Application)
Show Figures

Figure 1

Open AccessArticle
Soft Iterative Decoding Algorithms for Rateless Codes in Satellite Systems
Algorithms 2019, 12(8), 151; https://doi.org/10.3390/a12080151 - 29 Jul 2019
Abstract
The satellite system is one of the most efficient means for broadcasting due to its wide service coverage as well as the fact that it can provide high data rate services by using high frequency bands. However, there are a number of problems [...] Read more.
The satellite system is one of the most efficient means for broadcasting due to its wide service coverage as well as the fact that it can provide high data rate services by using high frequency bands. However, there are a number of problems in the satellite system, such as a long round trip delay (RTD) and heterogeneity of the channel conditions of the earth stations. Even though utilizing adaptive coding and modulation (ACM) is almost mandatory for the satellite systems using high frequency bands due to the serious rain fading, the long RTD makes it difficult to quickly respond to channel quality information, resulting in a decrease in the efficiency of ACM. A high heterogeneity of earth stations caused by a wide service coverage also makes it difficult to apply a uniform transmission mode, and thus satellite systems require receiver-dependent transmission modes. A rateless code can be an effective means to compensate for these disadvantages of satellite systems compared to terrestrial wireless systems. This paper presents soft iterative decoding algorithms for efficient application of rateless codes in satellite systems and demonstrates that rateless codes can be effectively used for hybrid automatic repeat request schemes. Full article
(This article belongs to the Special Issue Coding Theory and Its Application)
Show Figures

Figure 1

Back to TopTop