A. Janabekova, G. A. Kabatiansky, I. Kamel, T. F. Rabie, “Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory”, Probl. Peredachi Inf., 2022, Volume 58, Issue 4,Pages <nobr>50

This article is cited in 2 papers

Coding Theory

Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory

A. Janabekova^a, G. A. Kabatiansky^b, I. Kamel^c, T. F. Rabie^c

^a Interfaculty Department of Information Transmission Problems and Data Analysis, Moscow Institute of Physics and Technology (State University), Moscow, Russia
^b Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia
^c University of Sharjah, University City, Sharjah, United Arab Emirates

Abstract: We establish relations between several problems that are quite far from each other at first glance and formulate a number of open problems.

Keywords: convex polytopes, Boolean cube, group testing, counterfeit coin detection, signature codes for noisy multiple access channels, multimedia digital fingerprinting codes, vector support recovery by linear measurements against noise.

UDC: 621.391 : 519.72

Received: 01.11.2022
Revised: 22.11.2022
Accepted: 23.11.2022

DOI: 10.31857/S0555292322040052