Reduction and efficient solution of MILP models of mixed Hamming packings yielding improved upper bounds
Discrete Mathematics
2023-10-04 v1
Abstract
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 the concept of contact graph from classical continuous sphere packing problems, a reduction technique for the models is introduced, which enables their efficient solution. Several best known upper bounds are improved and some of them are found to be sharp.
Keywords
Cite
@article{arxiv.2310.01883,
title = {Reduction and efficient solution of MILP models of mixed Hamming packings yielding improved upper bounds},
author = {Péter Naszvadi and Mátyás Koniorczyk},
journal= {arXiv preprint arXiv:2310.01883},
year = {2023}
}
Comments
8 pages, 4 tables