2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DM2023
Reduction and efficient solution of MILP models of mixed Hamming packings yielding improved upper bounds
Péter Naszvadi, Mátyás Koniorczyk
Mixed Hamming packings are considered: the maximal cardinality given a minimum codeword Hamming distance of mixed codes is addressed via mixed integer programming models. Adopting…
quant-ph2022★ 2 cited
Simulating nonlocal no-signaling boxes
Mátyás Koniorczyk, Péter Naszvadi, András Bodor +3
We present a computer framework to simulate two-party boxes that exhibit nonclassical no-signaling correlations through a Web-based application programming interface (RESTful Web A…