Almost cover-free codes
From MaRDI portal
Publication:2364463
Recommendations
Cites work
- scientific article; zbMATH DE number 4085568 (Why is no real title available?)
- scientific article; zbMATH DE number 3801449 (Why is no real title available?)
- scientific article; zbMATH DE number 1420996 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Almost disjunctive list-decoding codes
- Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
- Bounds on the rate of disjunctive codes
- Cover-free codes and separating system codes
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Key storage in secure networks
- Multiple-access hyperchannel
- Nonrandom binary superimposed codes
- On the construction of \((w,r)\) cover-free codes
Cited in
(8)- Sum-free sets and short covering codes
- A note on the uniqueness of \((w, r)\) cover-free codes
- De Bruijn covering codes with arbitrary alphabets
- scientific article; zbMATH DE number 3911729 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- Almost affine codes
- Almost cover-free codes and designs
- Cover-free codes and separating system codes
This page was built for publication: Almost cover-free codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364463)