New bounds on 2-separable codes of length 2

DOI10.1007/S10623-013-9849-9MaRDI QIDQ488247zbMATHOpenAlexDBLPWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 2186983 (Why is no real title available?)
• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• A Note on Bipartite Graphs Without 2 k -Cycles
• A Theorem in Finite Projective Geometry and Some Applications to Number Theory
• Bipartite Ramsey numbers and Zarankiewicz numbers
• Collusion-secure fingerprinting for digital data
• Combinatorial properties of frameproof and traceability codes
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Frameproof Codes
• Graphs without cycles of even length
• Minimal Regular Graphs of Girths Eight and Twelve
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• 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
• On extremal bipartite graphs with high girth
• On product representation of powers. I
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Separable Codes
• The Zarankiewicz problem, cages, and geometries
• The size of bipartite graphs with a given girth
• \(C_ 6\)-free bipartite graphs and product representation of squares
• \(C_4\)-saturated bipartite graphs

Cited in

(10)

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

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)