2000 character limit reached
Minimizing costs of communication with random constant weight codes
Published 6 May 2021 in cs.IT and math.IT | (2105.02504v1)
Abstract: 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.