entropy-logo

Journal Browser

Journal Browser

Coding and Signal Processing for Data Storage Systems

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: 30 November 2026 | Viewed by 2674

Special Issue Editors


E-Mail Website
Guest Editor
Science, Mathematics, and Technology Cluster (SMT), Singapore University of Technology and Design (SUTD), Singapore
Interests: coding theory; information theory; signal processing for data storage systems; digital communications

E-Mail Website
Guest Editor
Science, Mathematics, and Technology Cluster (SMT), Singapore University of Technology and Design (SUTD), Singapore
Interests: coding theory and its applications; combinatorics; algorithms; optimization; codes for DNA data storage; deletion/insertion correcting codes; constrained codes for communication and storage systems

Special Issue Information

Dear Colleagues,

Data storage systems have revolutionized information technology over the past several decades, evolving from magnetic recording, optical recording, and ultra-high density magnetic recording to flash memories, distributed storage, various emerging non-volatile memory technologies (such as MRAM, STT-RAM, and ReRAM), and DNA-based data storage. The continuous improvement in the density of these data storage systems, as well as their various other specifications, requires innovative signal processing and coding techniques to combat severe noise and interference, guaranteeing system reliability, efficiency, security, and privacy.

The goal of the Special Issue is to showcase new research that addresses both the theoretical and practical aspects of coding and signal processing for data storage systems. We invite original contributions, as well as comprehensive surveys, including, but not limited to, the following areas:

  • Modelling of data storage channels;
  • Information theory for data storage channels and distributed storage networks;
  • Signal detection for data storage channels;
  • Coding for storage channels and distributed storage networks;
  • Error-correcting codes and constrained codes;
  • Codes for flash memories and emerging non-volatile memory technologies;
  • Coding techniques for DNA-based data storage;
  • Machine learning for data storage channels and distributed storage networks;
  • Security and privacy in cloud and edge computing, networking, and storage;
  • Signal processing for cloud and edge computing, networking, and storage systems.

Dr. Kui Cai
Dr. Tuan Thanh Nguyen
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 submissions that pass pre-check are 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 250 words) can be sent to the Editorial Office for assessment.

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. Entropy 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 2600 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-correction codes
  • constrained codes
  • efficient encoding/decoding algorithms
  • signal processing
  • channel capacity
  • machine learning
  • DNA data storage
  • non-volatile memory
  • distributed storage
  • security and privacy

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (2 papers)

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

Research

17 pages, 439 KB  
Article
Concatenated Constrained Coding: A New Approach to Efficient Constant-Weight Codes
by Kees Schouhamer Immink, Jos H. Weber, Tuan Thanh Nguyen and Kui Cai
Entropy 2026, 28(1), 78; https://doi.org/10.3390/e28010078 - 9 Jan 2026
Viewed by 604
Abstract
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two [...] Read more.
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more) cooperating constrained codes of low complexity enabling long constrained codes that are not practically feasible with prior art methods. We apply the concatenated coding approach to two case studies, namely the design of constant-weight and low-weight codes. In a binary constant-weight code, each codeword has the same number, w, of 1’s, where w is called the weight of a codeword. We specifically focus on the trading between coder complexity and redundancy. Full article
(This article belongs to the Special Issue Coding and Signal Processing for Data Storage Systems)
Show Figures

Figure 1

17 pages, 324 KB  
Article
On the Optimal File Size of Capacity-Achieving Byzantine-Resistant Private Information Retrieval Schemes
by Stanislav Kruglik, Han Mao Kiah, Son Hoang Dau and Huaxiong Wang
Entropy 2026, 28(1), 15; https://doi.org/10.3390/e28010015 - 23 Dec 2025
Viewed by 476
Abstract
We consider the problem of designing a Private Information Retrieval (PIR) scheme for n files replicated on k servers that can collude and return incorrect answers. Our goal is to correctly retrieve a specific message while keeping its identity private from the database [...] Read more.
We consider the problem of designing a Private Information Retrieval (PIR) scheme for n files replicated on k servers that can collude and return incorrect answers. Our goal is to correctly retrieve a specific message while keeping its identity private from the database servers. We focus on minimizing download costs and propose PIR schemes with minimal download costs and the smallest file size (proportional to the number of involved servers). Motivated by the possible presence of stragglers, we extend our previous conference results and propose a scheme in which the number of participating servers may vary. Full article
(This article belongs to the Special Issue Coding and Signal Processing for Data Storage Systems)
Back to TopTop