Almost cover-free codes

DOI10.1134/S0032946016020046zbMATH Open1369.94599MaRDI QIDQ2364463FDOQ2364463

Authors: Nikita Polyanskii 

Publication date: 21 July 2017

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

Recommendations

• Almost cover-free codes and designs
• Bounds on the rate of disjunctive codes
• Almost disjunctive list-decoding codes
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• Cover-free codes and separating system codes

zbMATH Keywords

almost cover-free (ACF) codelower and upper bound for capacity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Multiple-access hyperchannel
• Bounds on the rate of disjunctive codes
• Almost disjunctive list-decoding codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonrandom binary superimposed codes
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Title not available (Why is that?)
• Key storage in secure networks
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• Cover-free codes and separating system codes
• On the construction of \((w,r)\) cover-free codes

Cited In (8)

• A note on the uniqueness of \((w, r)\) cover-free codes
• Title not available (Why is that?)
• Sum-free sets and short covering codes
• Almost affine codes
• De Bruijn covering codes with arbitrary alphabets
• Almost cover-free codes and designs
• Cover-free codes and separating system codes
• Title not available (Why is that?)

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)