Minimizing costs of communication with random constant weight codes

05/06/2021
by   Pau Vilimelis Aceituno, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2020

Optimal Constant-Weight Codes under l_1-Metric

Motivated by the duplication-correcting problem for data storage in live...
research
10/09/2020

Model Exploration with Cost-Aware Learning

We present an extension to active learning routines in which non-constan...
research
07/09/2019

A Geometric Approach to Rank Metric Codes and a Classification of Constant Weight Codes

In this work we develop a geometric approach to the study of rank metric...
research
08/22/2022

Construction of binary linear constant weight codes by symmetric differences of supports

We give a construction for the binary linear constant weight codes by us...
research
07/15/2021

A Combinatorial Interpretation for the Shor-Laflamme Weight Enumerators of CWS Codes

We show that one of the Shor-Laflamme weight enumerators of a codeword s...
research
11/08/2022

Several classes of projective few-weight linear codes and their applications

It is well-known that few-weight linear codes have better applications i...

Please sign up or login with your details

Forgot password? Click here to reset