@inproceedings{b1de70ad94d0481293611cf12d5f2519,
title = "Error-set codes and related objects",
abstract = "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.",
author = "A. Braeken and S.I. Nikova and V.S. Nikov",
year = "2005",
doi = "10.1007/11533719_59",
language = "English",
isbn = "3-540-28061-8",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "577--585",
editor = "L. Wang",
booktitle = "Computing and combinatorics : 11th annual international conference, COCOON 2005, Kunming, Yunnan, China, August 16-19, 2005 : proceedings",
address = "Germany",
}