A Class of Optimal Cyclic Symbol-pair Codes from Combinatorial Designs

Motivated by the application of high-density data storage technologies, symbol-pair codes were defined by Cassuto and Blaum recently. In this coding model, every two consecutive symbols are read together to address channels with high write resolution but low read resolution, so that individual symbols cannot be read off due to physical limitations. Since such kind of code was introduced, a lot of work has been carried out by many researchers, including upper bounds, constructions, decoding et.al. In this work, we continue the research on the construction of symbol-pair codes. We will present one special construction for cyclic symbol-pair codes from the perspective of combinatorial designs.