Combinatorial constructions of separating codes

DOI10.1016/J.JCO.2024.101906MaRDI QIDQ6649717zbMATH OpenFDO

Authors Marcel Fernández, John Livieratos, Sebastià Martín

Publication date 6 December 2024

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCO.2024.101906

zbMATH Keywords

Lovász local lemmaMoser-Tardos constructive proofseparating codes

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94Bxx)

Recommendations

• Bounds on the rate of separating codes
• Upper Bounds on Separating Codes
• LATIN 2004: Theoretical Informatics
• \((2,1)\)-separating systems beyond the probabilistic bound
• Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions

Cites work

• A constructive proof of the general Lovász local lemma
• A constructive proof of the Lovász local lemma
• A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
• A sharper local lemma with improved applications
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• Acyclic edge coloring through the Lovász local lemma
• Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma
• Combinatorial properties of frameproof and traceability codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Graph colouring and the probabilistic method
• scientific article; zbMATH DE number 3771502 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• On certain inequalities involving the constant e and their applications
• On the algorithmic Lovász local lemma and acyclic edge coloring
• On the asymptotic behaviour of some towers of function fields over finite fields
• Random walks that find perfect objects and the Lovász local lemma
• Separating Partition Systems and Locally Different Sequences
• Separating systems
• The local lemma is tight for SAT
• The Lovász local lemma and its applications to some combinatorial arrays
• The Lovász Local Lemma and Satisfiability
• The Lovász Local Lemma – A Survey

Cited in

(1)

• Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions

This page was built for publication: Combinatorial constructions of separating codes

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