Maximum IPP codes of length 3

DOI10.1007/S00026-009-0036-7MaRDI QIDQ659811zbMATH OpenOpenAlexFDO

Authors Wen Jiang, Xingxing Yu, G. Y. Li

Publication date 24 January 2012

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-009-0036-7

zbMATH Keywords

complete graphcomponentedge colored graphIPP code

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)

Recommendations

• On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property
• On optimal codes with \(w\)-identifiable parent property
• Prolific Codes with the Identifiable Parent Property
• Codes with the identifiable parent property for multimedia fingerprinting
• Combinatorial properties of codes with w-identifiable parents property.

Cites work

• Graph theory with applications
• New bounds for perfect hashing via information theory
• On codes with the identifiable parent property
• On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property
• Parent-identifying codes

Cited in

(5)

• On optimal codes with \(w\)-identifiable parent property
• Combinatorial properties of codes with w-identifiable parents property.
• On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property
• Codes with the identifiable parent property for multimedia fingerprinting
• Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)

This page was built for publication: Maximum IPP codes of length 3

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