组合批处理码是为了表示如何把n项数据的子集存储到m个服务器里,使得当我们需要n项数据中的任意k项时.都可以通过从每个服务器里选择至多一项(可一般化为t项)来找到这k项,同时让这些服务器总存储量N尽可能小的一类组合结构.具有参数n,k,m的组合批处理码记作(n,N,k,m)-CBC.本文通过可分解横截设计RTD(q一2,q)构造了一类(q2+q-2,q3-q2-2q,q2-2q-3,q2-2q)-CBC.比较具有相同参数n.k,m的CBC的N值,本文的构造优于已有构造.
Combinatorial batch codes were introduced in order to represent that how to distribute a subset of a database of n items among m servers in such a way that when we need any k items among the n items, we can read at most one (or more generally, t) items from each server to retrieve them, and we want the total storage N as small as possible. A combinatorial batch code with parameters n, k, m is denoted by (n, N, k, rn)-CBC. In this paper, we present a new construction of (q2 + q - 2, q3 -q2 -2q, q2 - 2q - 3, q2 - 2q)-CBC based on RTD(q - 2, q). For determining N as small as possible of a combinatorial batch code with the same parameters n, k, m, our construction is better than the current constructions.