Bounds on the rate of separating codes (Q1752294)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Bounds on the rate of separating codes	scientific article

Statements

scholarly article

0 references

Bounds on the rate of separating codes (English)

0 references

0 references

Problems of Information Transmission

0 references

publication date

24 May 2018

0 references

MaRDI profile type

MaRDI publication profile

0 references

Completely separating systems

0 references

Separating systems

0 references

On generalized separating hash families

0 references

Collusion-secure fingerprinting for digital data

0 references

Combinatorial properties of frameproof and traceability codes

0 references

Digital fingerprinting codes: problem statements, constructions, identification of traitors

0 references

Robust Parent-Identifying Codes and Combinatorial Arrays

0 references

Monotone Functions in Sequential Circuits

0 references

Key storage in secure networks

0 references

Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others

0 references

0 references

Bounds on the rate of disjunctive codes

0 references

Superimposed Codes and Threshold Group Testing

0 references

Interval Packing and Covering in the Boolean Lattice

0 references

Asymptotic upper bound for the rate of \((w,r)\) cover-free codes

0 references

full work available at URL

https://doi.org/10.1134/s0032946017010021

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S0032946017010021

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1752294

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1752294&oldid=37169696"