On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

Author： Sridharan A.   Lentmaier M.   Truhachev D.   Costello D.   Zigangirov K.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.41, Iss.1, 2005-01, pp. : 33-44

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

Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes

By Chau H.  

Quantum Information Processing, Vol. 10, Iss. 2, 2011-04 ,pp. : 213-229

Springer Publishing Company

Access to resources Recommend Favorite

On the Performance and Implementation Issues of Interleaved Single Parity Check Turbo Product Codes: Special Issue on Signal Processing for Broadband Communications (Guest Editors: Naresh R. Shanbhag and Keshab K. Parhi)

By Chen Yanni   Parhi Keshab K.  

Journal of VLSI Signal Processing, Vol. 39, Iss. 1-2, 2005-01 ,pp. : 35-47

Springer Publishing Company

Access to resources Recommend Favorite

Network Codes Based on Symmetric Matrices

By  

International Journal of Handheld Computing Research (IJHCR), Vol. 7, Iss. 4, 2016-10 ,pp. : 1-14

IGI Global_journal

Access to resources Recommend Favorite

Generalized Low Rank Approximations of Matrices

By Ye Jieping  

Machine Learning, Vol. 61, Iss. 1-3, 2005-11 ,pp. : 167-191

Springer Publishing Company

Access to resources Recommend Favorite

Bayesian generalized probability calculus for density matrices

By Warmuth Manfred   Kuzmin Dima  

Machine Learning, Vol. 78, Iss. 1-2, 2010-01 ,pp. : 63-101

Springer Publishing Company

Access to resources Recommend Favorite