• Corpus ID: 237194856

Improved Lower Bounds for Secure Codes and Related Structures

  title={Improved Lower Bounds for Secure Codes and Related Structures},
  author={Bingchen Qian and Xin Wang and Gennian Ge},
Secure codes are widely-studied combinatorial structures which were introduced for traitor tracing in broadcast encryption. To determine the maximum size of such structures is the main research objective. In this paper, we investigate the lower bounds for secure codes and their related structures. First, we give some improved lower bounds for the rates of 2-frameproof codes and 2-separable codes for slightly large alphabet size. Then we improve the lower bounds for the rate of some related… 

Figures from this paper


Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures
Frameproof codes were introduced by Boneh and Shaw as a method of \digital ngerprinting" which prevents a coalition of a speciied size c from framing a user not in the coalition. Stinson and Wei then
New Bounds on Separable Codes for Multimedia Fingerprinting
  • Fei Gao, G. Ge
  • Computer Science
    IEEE Transactions on Information Theory
  • 2014
Improved bounds for the size of separable codes are provided using a combinatorial technique named grouping coordinates and 2̅-separable codes with asymptotically optimal rate are obtained by the deletion method.
Probabilistic Existence Results for Separable Codes
  • S. Blackburn
  • Physics, Computer Science
    IEEE Transactions on Information Theory
  • 2015
Improved probabilistic existence results for t-separable codes when t ≥ 3 are provided and the bound of Gao and Ge can be strengthened to show that the number of codewords of a q-ary 2̅- separable code of length n is at most q.
New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach
A hypergraph model is used to characterize the combinatorial structure of secure codes and its related hash families and a new approach to evaluate the lower bounds is provided, illustrated via the examples of existence results on some perfect hash families, frameproof codes, and separable codes.
(2, 1)-Separating systems beyond the probabilistic bound
This work gives new lower bounds on the rate of linear intersecting codes over large alphabets, and constructs binary (2,1)-separating systems of asymptotic rate exceeding the one given by the probabilistic method, which was the best lower bound available up to now.
2-Cancellative Hypergraphs and Codes
  • Z. Füredi
  • Computer Science, Mathematics
    Combinatorics, Probability and Computing
  • 2012
Using an algebraic construction, the previous upper bounds are improved and it is shown that c2(n, 2k) = Θ(nk) for each k when n → ∞.
New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
  • L. Tolhuizen
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 2000
This work constructs uniquely decodable (UD) code pairs for the binary multiplying channel without feedback, using pairs of binary codes and obtains an asymptotically optimal construction for the combinatorial concept of cancellative families of sets.
Asymptotic bounds on frameproof codes
  • C. Xing
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 2002
The asymptotic behavior of frameproof codes is studied and the lower bound obtained directly by applying algebraic-geometry codes is improved by employing the Jacobian group structure of algebraic curves.
Improved Bounds for Separable Codes and $B_2$ Codes
New lower and upper bounds for the largest code rates of separable codes and LaTeX codes are provided, which improve the existing results when the alphabet size <inline-formula> <tex-math notation="LaTeX">$q$ </tex-Math></inline- formula> is relatively small.
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others