A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Symbol-pair codes were proposed for the application in high density storage systems, where it is not possible to read individual symbols. Yaakobi, Bruck and Siegel proved that the minimum pair-distance of binary linear cyclic codes satisfies ⌈ d_2 ≥3d_H/2⌉ and introduced b-symbol metric codes in 2016. In this paper covering codes in b-symbol metrics are considered. Some examples are given to show that the Delsarte bound and the Norse bound for covering codes in the Hamming metric are not truearXiv:2206.12668v1 fatcat:ptda5ef3wzfbngc72y2m66xi2m