Generalized Singleton Type Upper Bounds release_dtge2iu3k5ccdm7r7pgucojqfy

by Hao Chen

Released as a article .

2022  

Abstract

In this paper we give upper bounds on the sizes of (d, L) list-decodable codes in the Hamming metric space from various covering codes with the covering radius d. When the list size L is 1, this gives many new Singleton type upper bounds on the sizes of codes with a given minimum Hamming distance. These upper bounds for codes are tighter than the Griesmer bound when the lengths of codes are large. Some upper bounds on the lengths of general small Singleton defect are given. An upper bound on the lengths of list-decodable codes attaining the generalized Singleton bound is also presented. As an application of our generalized Singleton type upper bounds on Hamming metric error-correcting codes, the generalized Singleton type upper bounds on insertion-deletion codes is given. Our this upper bound is much stronger than the direct Singleton bound for insertion-deletion codes when the lengths are large. We also give upper bounds on the lengths of small dimension optimal locally recoverable codes and small dimension optimal (r, δ) locally recoverable codes with any fixed given minimum distance.
In text/plain format

Archived Files and Locations

application/pdf  269.2 kB
file_wqr63fdhvvdrzbale626jabtqa
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2022-08-03
Version   v2
Language   en ?
arXiv  2208.01138v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: b7c4f82d-d4bf-4fd1-b027-1e162c401b40
API URL: JSON