Bounds on Mixed Codes with Finite Alphabets

Yonatan Yehezkeally, Haider Al Kim, Sven Puchinger, Antonia Wachter-Zeh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


Mixed codes, which are error-correcting codes in the Cartesian product of different-sized spaces, model degrading storage systems well. While such codes have previously been studied for their algebraic properties (e.g., existence of perfect codes) or in the case of unbounded alphabet sizes, we focus on the case of finite alphabets, and generalize the Gilbert-Varshamov, sphere-packing, Elias-Bassalygo, and first linear programming bounds to that setting. In the latter case, our proof is also the first for the non-symmetric mono-alphabetic q-ary case using Navon and Samorodnitsky's Fourier-analytic approach.

Original languageEnglish
Title of host publication2023 IEEE Information Theory Workshop, ITW 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9798350301496
StatePublished - 2023
Event2023 IEEE Information Theory Workshop, ITW 2023 - Saint-Malo, France
Duration: 23 Apr 202328 Apr 2023

Publication series

Name2023 IEEE Information Theory Workshop, ITW 2023


Conference2023 IEEE Information Theory Workshop, ITW 2023


Dive into the research topics of 'Bounds on Mixed Codes with Finite Alphabets'. Together they form a unique fingerprint.

Cite this