Families of traceability codes based on the Chinese Remainder Theorem

Abstract

In this paper we present constructions of traceability codes based on the Chinese Remainder Theorem. Taking into account the non-uniformity of the alphabet of the code, we derive a new expression for the minimum distance that allows us to provide a criterion to obtain traceability codes with the maximum number of code words. In order to make the traceability conditions as independent as possible of the code parameters, we also present a new family of non-uniform alphabet codes whose tracing capabilities only depend on the code length.