Completion of codes with finite bi-decoding delays

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 123-137

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

Decoding of random network codes

By Gabidulin E.

Problems of Information Transmission, Vol. 46, Iss. 4, 2010-12 ,pp. : 300-320

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Hajos factorizations and completion of codes

By Nguyen H.L.

Theoretical Computer Science, Vol. 182, Iss. 1, 1997-08 ,pp. : 245-256

Elsevier

Access to resources Recommend Favorite

Completion of recognizable bifix codes

By D. Perrin Zhang L. Shen Z.

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 345-355

Elsevier

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

Chase-Like Decoding of Arithmetic Codes with Applications

International Journal of Computer Vision and Image Processing (IJCVIP), Vol. 1, Iss. 1, 2011-01 ,pp. : 27-40

IGI Global_journal

Access to resources Recommend Favorite