We present a framework for minimizing costs in constant weight codes while maintaining a certain amount of differentiable codewords. Our calculations are based on a combinatorial view of constant weight codes and relay on simple approximations.
@article{arxiv.2105.02504,
title = {Minimizing costs of communication with random constant weight codes},
author = {Pau Vilimelis Aceituno},
journal= {arXiv preprint arXiv:2105.02504},
year = {2021}
}