By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the error-correcting codes in the sense that the minimum distance of the code is replaced by a collection of monotone decreasing sets Δ which define the supports of the vectors that do not belong to the code. In this paper we consider a subclass of these codes - so called, ideal codes - investigating their properties such as the relation with its dual and a formula for the weight enumerator. Next we show that the Δ-set of these codes corresponds to the independent sets of a matroid. Consequently, this completes the equivalence of ideal linear secret sharing schemes and matroids on one hand and linear secret sharing schemes and error-set correcting codes on the other hand. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Braeken, A., Nikov, V., & Nikova, S. (2005). Error-set codes and related objects. In Lecture Notes in Computer Science (Vol. 3595, pp. 577–585). Springer Verlag. https://doi.org/10.1007/11533719_59
Mendeley helps you to discover research relevant for your work.