Binary Perfect Codes of Length 15 by the Generalized Concatenated Construction

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.40, Iss.1, 2004-01, pp. : 25-36

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

On switching equivalence of n -ary quasigroups of order 4 and perfect binary codes

By Krotov D.

Problems of Information Transmission, Vol. 46, Iss. 3, 2010-09 ,pp. : 219-224

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Construction of perfect q-ary codes by switchings of simple components

By Los’ A.

Problems of Information Transmission, Vol. 42, Iss. 1, 2006-03 ,pp. : 30-37

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Multitrial decoding of concatenated codes using fixed thresholds

By Senger C. Sidorenko V. Bossert M. Zyablov V.

Problems of Information Transmission, Vol. 46, Iss. 2, 2010-06 ,pp. : 127-141

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

The construction of binary Huffman equivalent codes with a greater number of synchronising codewords

By Huang Yuh-Ming Wu Sheng-Chi

International Journal of Ad Hoc and Ubiquitous Computing, Vol. 9, Iss. 1, 2012-02 ,pp. : 54-65

Inderscience Publishers

Access to resources Recommend Favorite

Construction of Perfect q-ary Codes by Sequential Switchings of tilde{alpha}-Components

By Los' A. V.

Problems of Information Transmission, Vol. 40, Iss. 1, 2004-01 ,pp. : 37-43

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite