New bounds on \(\bar{2}\)-separable codes of length 2
From MaRDI portal
Publication:488247
DOI10.1007/s10623-013-9849-9zbMath1351.94091OpenAlexW2090770845WikidataQ59404589 ScholiaQ59404589MaRDI QIDQ488247
Yuan-Hsun Lo, Jing Jiang, Minquan Cheng, Hung-Lin Fu, Ying Miao
Publication date: 23 January 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9849-9
projective planemultimedia fingerprintingseparable code4-cycle free bipartite graphZarankiewicz number
Combinatorial aspects of finite geometries (05B25) Combinatorial codes (94B25) Authentication, digital signatures and secret sharing (94A62) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51)
Related Items
Strongly separable codes, Bounds and constructions for \(\overline{3}\)-separable codes with length 3, Multimedia IPP codes with efficient tracing, \(\overline{2}\)-separable codes with length 5, Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3, Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing, Asymptotically optimal \(\overline {2}\)-separable codes with length 4, Improved bounds on 2-frameproof codes with length 4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- On codes with the identifiable parent property
- On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems
- \(C_ 6\)-free bipartite graphs and product representation of squares
- The size of bipartite graphs with a given girth
- Bipartite Ramsey numbers and Zarankiewicz numbers
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- \(C_4\)-saturated bipartite graphs
- On product representation of powers. I
- Graphs without cycles of even length
- On extremal bipartite graphs with high girth
- Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Collusion-secure fingerprinting for digital data
- Separable Codes
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- Minimal Regular Graphs of Girths Eight and Twelve
- A Note on Bipartite Graphs Without 2 k -Cycles
- A Theorem in Finite Projective Geometry and Some Applications to Number Theory
