Open AccessA Family of Almost MDS Symbol-Pair Codes of Length 8 p
Author(s) -
Hai Q. Dinh,
Bac T Nguyen,
Hiep L Thi,
Woraphon Yamaka
Publication year - 2025
Publication title -
ieee access
Language(s) - English
Resource type - Magazines
SCImago Journal Rank - 0.587
H-Index - 127
eISSN - 2169-3536
DOI - 10.1109/access.2025.3590462
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
In high-density data storage systems, symbol-pair codes are commonly used to prevent symbol-pair errors. Designing maximum distance separable (MDS) codes is crucial in symbol-pair coding theory because MDS symbol-pair codes are the best at meeting the Singleton bound, which is a measure of their effectiveness. However, obtaining MDS codes is challenging due to the difficulty of meeting the strict requirements of the Singleton bound. As an alternative, almost maximum distance separable (AMDS) symbol-pair codes are explored since they are not as perfect as MDS codes according to the Singleton bound. In this paper, we introduce a new family of AMDS symbol-pair cyclic codes of length 8 p for every prime number p ≡ 1 mod 8. This results in a useful collection of AMDS symbol-pair cyclic codes applicable directly in various real-world scenarios.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom