Almost disjunctive list-decoding codes (Q259899)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Almost disjunctive list-decoding codes	scientific article

Statements

scholarly article

0 references

Almost disjunctive list-decoding codes (English)

0 references

Arkadii G. D'yachkov

0 references

0 references

V. Yu. Shchukin

0 references

Nikita Polyanskii

0 references

Problems of Information Transmission

0 references

publication date

18 March 2016

0 references

full work available at URL

https://arxiv.org/abs/1407.2482

0 references

MaRDI profile type

MaRDI publication profile

0 references

Nonrandom binary superimposed codes

0 references

0 references

Families of finite sets in which no set is covered by the union of two others

0 references

0 references

0 references

0 references

New constructions of superimposed codes

0 references

0 references

0 references

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

0 references

Bounds on the rate of disjunctive codes

0 references

0 references

0 references

Multiple-access hyperchannel

0 references

On a Design Problem for Screening Experiments

0 references

The separating property of random matrices

0 references

0 references

Error probability bounds for two models of randomized design of elimination experiments

0 references

Bounds for error probability for a symmetrical model in designing screening experiments

0 references

New bounds for union-free families of sets

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S0032946015020039

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:259899

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