English

Multi-Block Interleaved Codes for Local and Global Read Access

Information Theory 2017-01-26 v1 math.IT

Abstract

We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the correction capability of the sub-block code through its gap tt from optimal minimum distance, and look to have full-block minimum distance that grows with the parameter tt. We construct two families of such codes when the number of sub-blocks is 33. The codes match the distance properties of known integrated-interleaving codes, but with the added feature of mapping the same number of information symbols to each sub-block. As such, they are the first codes that provide read access in multiple size granularities and correction capabilities.

Keywords

Cite

@article{arxiv.1701.07184,
  title  = {Multi-Block Interleaved Codes for Local and Global Read Access},
  author = {Yuval Cassuto and Evyatar Hemo and Sven Puchinger and Martin Bossert},
  journal= {arXiv preprint arXiv:1701.07184},
  year   = {2017}
}
R2 v1 2026-06-22T17:59:33.956Z