Abstract:
Possibilities of using generalized $(L,G)$-codes for solving various problems of information security are considered. In particular, the variant of using such codes for syndrome based information embedding, code based compression, threshold key distribution schemes is considered.
Keywords:weighted Hamming distance metric, generalized $(L,G)$-codes, information security.