New bounds on 2-separable codes of length 2

DOI10.1007/S10623-013-9849-9zbMATH Open1351.94091DBLPjournals/dcc/ChengFJLM15OpenAlexW2090770845WikidataQ59404589 ScholiaQ59404589MaRDI QIDQ488247FDOQ488247

Authors: Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, 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

Recommendations

• Bounds and constructions for \(\overline{3}\)-separable codes with length 3
• \(\overline{2}\)-separable codes with length 5
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• A note on \(\overline{2} \)-separable codes and \(B_2\) codes
• LATIN 2004: Theoretical Informatics

zbMATH Keywords

multimedia fingerprintingprojective planeseparable code4-cycle free bipartite graphZarankiewicz number

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40) Authentication, digital signatures and secret sharing (94A62) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Title not available (Why is that?)
• A Theorem in Finite Projective Geometry and Some Applications to Number Theory
• \(C_4\)-saturated bipartite graphs
• Title not available (Why is that?)
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Frameproof Codes
• Collusion-secure fingerprinting for digital data
• Separable Codes
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• Title not available (Why is that?)
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Minimal Regular Graphs of Girths Eight and Twelve
• \(C_ 6\)-free bipartite graphs and product representation of squares
• Combinatorial properties of frameproof and traceability codes
• On codes with the identifiable parent property
• The size of bipartite graphs with a given girth
• A Note on Bipartite Graphs Without 2 k -Cycles
• On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems
• Bipartite Ramsey numbers and Zarankiewicz numbers
• On product representation of powers. I
• Graphs without cycles of even length
• The Zarankiewicz problem, cages, and geometries
• Title not available (Why is that?)
• On extremal bipartite graphs with high girth

Cited In (10)

• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Strongly separable codes
• \(\overline{2}\)-separable codes with length 5
• Improved bounds on 2-frameproof codes with length 4
• Bounds and constructions for \(\overline{3}\)-separable codes with length 3
• Cryptography and Coding
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• Multimedia IPP codes with efficient tracing
• A note on \(\overline{2} \)-separable codes and \(B_2\) codes
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3

This page was built for publication: New bounds on \(\bar{2}\)-separable codes of length 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488247)