Erratum to: ``Bounds on the rate of disjunctive codes

DOI10.1134/S0032946016020083MaRDI QIDQ2364468zbMATH OpenOpenAlexFDO

Authors Nikita Polyanskii, V. Yu. Shchukin, Arkadii G. D'yachkov, I. V. Vorob'ev

Publication date 21 July 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Bounds on the rate of disjunctive codes
• Erratum to: ``On completely regular codes
• A Lagrange–Dual Lower Bound to the Error Exponent of the Typical Random Code
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Erratum to ``On the dimensions of the binary codes of a class of unitals
• Publication:4886138
• scientific article; zbMATH DE number 3478754
• A construction of codes with exponential error bounds on arbitrary discrete memoryless channels

Cited in

(8)

• Separable collusion-secure multimedia codes
• Bounds on the rate of disjunctive codes
• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• Exact learning from an honest teacher that answers membership queries
• Corrigendum: Optimal asymptotic cloning machines (2014New J. Phys.16063005)
• Corrections to “Hash Property and Fixed-Rate Universal Coding Theorems” [Jun 10 2688-2698]
• A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
• A survey of cover-free families: constructions, applications, and generalizations

This page was built for publication: Erratum to: ``Bounds on the rate of disjunctive codes

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