On the Optimality of Trivial (w, r)-Cover-Free Codes

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.40, Iss.3, 2004-07, pp. : 195-201

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes

By Lebedev V. S.

Problems of Information Transmission, Vol. 39, Iss. 4, 2003-10 ,pp. : 317-323

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Note on the Uniqueness of (w, r) Cover-Free Codes

By Lebedev V.

Problems of Information Transmission, Vol. 41, Iss. 3, 2005-07 ,pp. : 199-203

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On the asymptotic optimality of the cμ/θ rule under ergodic cost

By Atar Rami Giat Chanit Shimkin Nahum

Queueing Systems, Vol. 67, Iss. 2, 2011-02 ,pp. : 127-144

Springer Publishing Company

Access to resources Recommend Favorite

Interrelation of the Cyclic and Weight Structure of Codes over GF(q) and Proportionality Classes

By Mullayeva I.

Problems of Information Transmission, Vol. 41, Iss. 2, 2005-04 ,pp. : 130-133

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Some high-rate linear codes over GF(5) and GF(7)

By Daskalov R.

Problems of Information Transmission, Vol. 43, Iss. 2, 2007-06 ,pp. : 124-131

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite