Advances in Coding Theory and Error Correction

The field of coding theory and error correction is moving towards the development of more efficient and robust codes for various applications, including storage and communication systems. Recent research has focused on the design of two-dimensional codes, coded caching schemes, and list decoding algorithms for expander-based codes. These advancements have the potential to improve the reliability and performance of data storage and transmission systems. Notable papers in this area include: A paper that proposes a universal framework for designing two-dimensional codes with bounded-weight constraints, which has the potential to improve the reliability of storage systems. A paper that presents a novel coded caching scheme for partially cooperative device-to-device networks, which can operate in all feasible memory regimes. A paper that develops a comprehensive decoding strategy for monotone chain polar codes, which can handle arbitrary numbers of terminals and non-binary alphabets.

Sources

From One-Dimensional Codes to Two-Dimensional Codes: A Universal Framework for the Bounded-Weight Constraint

A Novel Coded Caching Scheme for Partially Cooperative Device-to-Device Networks

Successive Cancellation Decoding For General Monotone Chain Polar Codes

New Bounds for Linear Codes with Applications

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I

Trace Repair Never Loses to Classical Repair: Exact and Explicit Helper Nodes Selection

Codes Correcting Transpositions of Consecutive Symbols

The Linear Reliability Channel

The Shannon Upper Bound for the Error Exponent

Built with on top of