Improved upper bounds for the rate of separating and completely separating codes

DOI10.1134/s0032946022030048zbMath1530.94070OpenAlexW4312656989MaRDI QIDQ6173461

I. V. Vorob'ev, Vladimir Lebedev

Publication date: 21 July 2023

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946022030048

zbMATH Keywords

Plotkin boundasymptotic rateseparating codescompletely separating codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

• \((2,1)\)-separating systems beyond the probabilistic bound
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Key storage in secure networks
• Families of finite sets in which no set is covered by the union of two others
• Completely separating systems
• On codes with the identifiable parent property
• New upper bounds on cardinality of separating systems
• Bounds on the rate of separating codes
• Some new bounds for cover-free families
• Traceability codes and their generalizations
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• On generalized separating hash families
• Separating Partition Systems and Locally Different Sequences
• Monotone Functions in Sequential Circuits
• Frameproof Codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Nonrandom binary superimposed codes
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved upper bounds for the rate of separating and completely separating codes