|
This article is cited in 2 scientific papers (total in 2 papers)
Coding Theory
Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
A. Janabekovaa, G. A. Kabatianskyb, I. Kamelc, T. F. Rabiec 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.
Received: 01.11.2022 Revised: 22.11.2022 Accepted: 23.11.2022
Citation:
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., 58:4 (2022), 50–61; Problems Inform. Transmission, 58:4 (2022), 341–351
Linking options:
https://www.mathnet.ru/eng/ppi2383 https://www.mathnet.ru/eng/ppi/v58/i4/p50
|
|