Asymptotic bounds on frameproof codes

DOI10.1109/TIT.2002.804111zbMath1062.94058OpenAlexW2124938909MaRDI QIDQ4677620

Xing, Chaoping

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2002.804111

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Jacobians, Prym varieties (14H40)

Related Items (9)

On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\) ⋮ Sliding-window dynamic frameproof codes ⋮ Separation and Witnesses ⋮ \((2,1)\)-separating systems beyond the probabilistic bound ⋮ Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method ⋮ Wide-sense 2-frameproof codes ⋮ On generalized separating hash families ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

This page was built for publication: Asymptotic bounds on frameproof codes