On Linear Perfect b -Symbol Codes over Finite Fields
Kanat Abdukhalikov (),
Jiajie Chen and
Rongquan Feng
Additional contact information
Kanat Abdukhalikov: Department of Mathematical Sciences, UAE University, Al Ain P.O. Box 15551, United Arab Emirates
Jiajie Chen: School of Mathematical Sciences, Peking University, Beijing 100871, China
Rongquan Feng: School of Mathematical Sciences, Peking University, Beijing 100871, China
Mathematics, 2023, vol. 11, issue 19, 1-13
Abstract:
Motivated by the application of high-density data storage technologies, Cassuto and Blaum introduced codes for symbol-pair read channels in 2011, and Yaakobi et al. generalized the coding framework to that for b -symbol read channels where b ≥ 2 in 2016. In this paper, we establish a b -sphere-packing bound and present a recurrence relationship for the b -weight enumerator. We determine all parameters of linear perfect b -symbol e -error-correcting codes over F q for e < 2 b and show that for 2 b ≤ e < 3 b , there exist at most finite such codes for a given b , e , and q . We construct a family of linear perfect b -symbol b -error-correcting codes over F q using constacyclic codes.
Keywords: b-symbol code; b-weight; b-distance; b-sphere-packing bound; perfect b-symbol code (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/11/19/4128/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/19/4128/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:19:p:4128-:d:1251098
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().