Function-correcting codes improve symbol-pair error handling in psks
Function-Correcting Lee-distance Codes for Symbol-Pair Read Channels
Information Theory
Summary
Modern storage systems read data in overlapping pairs of symbols, which can cause unique errors. The authors study special codes that protect certain computations on messages, rather than the entire message, for these symbol-pair errors. They extend previous math models to better fit common signal types used in communication, called phase-shift keying (PSK). Their work provides new methods and limits on how efficiently such codes can be designed for error correction in these settings.
What this means in practice
- •For storage system engineers: Design error-correcting codes that reduce redundancy while protecting key computations for phase-shift keying storage reading overlapping symbol pairs.
- •For communication hardware developers: Implement coding schemes tailored to q-ary PSK modulation that improve resilience to symbol-pair errors using Lee distance metrics.
Authors
Hareesh K., B. Sundar Rajan
Abstract
Function-correcting codes (FCCs) protect specified function evaluations of messages against errors while reducing the redundancy required for reliable communication. We study FCCs for symbol-pair read channels, motivated by high-density storage systems that read overlapping symbol pairs. Phase-shift keying (PSK) modulation is well-suited to such systems due to its bandwidth efficiency and noise robustness. While FCCs for symbol-pair read channels have been studied under the Hamming metric, the Lee metric is a more appropriate error model for $q$-ary PSK and, hence for $q$-ary symbol-pair read channels. We generalize the symbol-pair Lee distance, previously defined only over $\mathbb{Z}_4$, to $\mathbb{Z}_q$, $q\ge2$, and introduce function-correcting symbol-pair Lee-distance codes (FCSPLCs) over $\mathbb{Z}_q$, specializing to $q=2^m$, $m\ge1$, for $2^m$-ary PSK constellations. We investigate their redundancy requirements by introducing irregular-pair Lee-distance codes and relating the optimal redundancy of FCSPLCs to the shortest length of such codes. We derive Plotkin-type and Gilbert--Varshamov-type bounds on the optimal redundancy through lower and upper bounds on the shortest length of irregular-pair Lee-distance codes. For bijective functions, we obtain corresponding Plotkin-type and Gilbert--Varshamov-type bounds for classical Lee metric codes for symbol-pair read channels over $\mathbb{Z}_q$, which, to the best of our knowledge, are the first such bounds for the Lee metric symbol-pair setting. We then specialize the FCSPLC framework to pair-locally bounded functions, the Pair-Lee weight function, and the Pair-Lee weight distribution function, giving explicit constructions and corresponding bounds on the optimal redundancy. Finally, for linear functions, we derive a Plotkin-type lower bound on the optimal redundancy.