The Grey-Rankin bound for nonbinary codes

Author： Bassalygo L.   Dodunekov S.   Zinoviev V.   Helleseth T.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.42, Iss.3, 2006-09, pp. : 197-203

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

Nonbinary Error-Correcting Codes with One-Time Error-Free Feedback

By Bassalygo L.  

Problems of Information Transmission, Vol. 41, Iss. 2, 2005-04 ,pp. : 125-129

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

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 polynomial algorithm for continuous non-binary disjunctive CSPs: extended DLRs

By Salido M.A.   Barber F.  

Knowledge-Based Systems, Vol. 16, Iss. 5, 2003-07 ,pp. : 277-285

Elsevier

Access to resources Recommend Favorite

Code bounds for multiple packings over a nonbinary finite alphabet

By Blinovsky V.  

Problems of Information Transmission, Vol. 41, Iss. 1, 2005-01 ,pp. : 23-32

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On DNA Codes

By D'yachkov A.   Vilenkin P.   Ismagilov I.   Sarbaev R.   Macula A.   Torney D.   White S.  

Problems of Information Transmission, Vol. 41, Iss. 4, 2005-10 ,pp. : 349-367

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite