A Version of Delsarte's Linear Program for Constrained Systems

Rameshwar, VA and Kashyap, N (2023) A Version of Delsarte's Linear Program for Constrained Systems. In: 2023 IEEE International Symposium on Information Theory, ISIT 2023, 25 - 30 June 2023, Taipei, pp. 30-35.

PDF IEEE_ISIT2023_2023_30-35_2023.pdf - Published Version Restricted to Registered users only Download (993kB) | Request a copy

Abstract

In this paper, we present numerical upper bounds on the sizes of constrained codes with a prescribed minimum distance. We accomplish this by extending Delsarte's linear program (LP) (Delsarte (1973)) to the setting of constrained codes, with the value of optimal solutions to this LP giving us the desired upper bound, for a fixed constraint. We also describe an equivalent LP, with fewer variables and LP constraints, obtained by symmetrizing our LP. We observe that for different constraints of interest, our upper bounds beat the generalized sphere packing upper bounds of Fazeli, Vardy, and Yaakobi (2015). © 2023 IEEE.

Item Type:	Conference Paper
Publication:	IEEE International Symposium on Information Theory - Proceedings
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to the Institute of Electrical and Electronics Engineers Inc.
Keywords:	Constrained codes; Constrained systems; Equivalent-linear; Linear programs; Minimums distance; Optimal solutions; Program constraints; Sphere packings; Upper Bound, Linear programming
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	28 Nov 2023 10:22
Last Modified:	28 Nov 2023 10:22
URI:	https://eprints.iisc.ac.in/id/eprint/83272

Actions (login required)

View Item