Woven convolutional graph codes with large free distances

Author： Bocharova I.   Hug F.   Johannesson R.   Kudryashov B.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.47, Iss.1, 2011-03, pp. : 1-14

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

Error exponents for product convolutional codes

By Medina C.   Sidorenko V.   Zyablov V.  

Problems of Information Transmission, Vol. 42, Iss. 3, 2006-09 ,pp. : 167-182

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Detecting and Correcting Capabilities of Convolutional Codes

By Zyablov V. V.   Johannesson R.   Pavlushkov V. A.  

Problems of Information Transmission, Vol. 40, Iss. 3, 2004-07 ,pp. : 187-194

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Completing comma-free codes

By Lam N.H.  

Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. : 399-415

Elsevier

Access to resources Recommend Favorite

Minority codes with improved embedding efficiency for large payloads

By Liu Hongmei   Yao Xinzhi   Huang Jiwu  

Multimedia Tools and Applications, Vol. 52, Iss. 2-3, 2011-04 ,pp. : 431-443

Springer Publishing Company

Access to resources Recommend Favorite

Finding Frequent Patterns in a Large Sparse Graph*

By Kuramochi Michihiro   Karypis George  

Data Mining and Knowledge Discovery, Vol. 11, Iss. 3, 2005-11 ,pp. : 243-271

Springer Publishing Company

Access to resources Recommend Favorite