Error-Set Codes and Related Objects
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.
An Braeken Ventzislav Nikov Svetla Nikova
Department Electrical Engineering, ESAT/COSIC Katholieke Universiteit Leuven, Kasteelpark Arenberg 1 Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 560
国际会议
The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)
昆明
英文
577-585
2005-08-01（万方平台首次上网日期，不代表论文的发表时间）