Access the full text.
Sign up today, get DeepDyve free for 14 days.
Sarah Johnson, S. Weller (2003)
A family of irregular LDPC codes with low encoding complexityIEEE Communications Letters, 7
Y. Kou, Shu Lin, M. Fossorier (2001)
Low-density parity-check codes based on finite geometries: A rediscovery and new resultsIEEE Trans. Inf. Theory, 47
R. Tanner, D. Sridhara, T. Fuja (2001)
A Class of Group-Structured LDPC Codes
M. Baldi, Marco Bianchi, F. Chiaraluce (2013)
Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems2013 IEEE International Conference on Communications Workshops (ICC)
Tao Xia, B. Xia (2005)
Quasi-cyclic codes from extended difference familiesIEEE Wireless Communications and Networking Conference, 2005, 2
D. Hocevar (2003)
LDPC code construction with flexible hardware implementationIEEE International Conference on Communications, 2003. ICC '03., 4
Lei Chen, Jun Xu, I. Djurdjevic, Shu Lin (2004)
Near Shannon limit quasi-cyclic low-density parity-check codesGLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489), 4
I. Theory (2003)
Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems — Amendment for Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands
Zongwang Li, B. Kumar (2004)
A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graphConference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004., 2
D. Hocevar (2003)
Efficient encoding for a family of quasi-cyclic LDPC codesGLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489), 7
M. Baldi, F. Bambozzi, F. Chiaraluce (2011)
On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix CodesIEEE Transactions on Information Theory, 57
M. Fujisawa, S. Sakata (2005)
A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
Rafael Misoczki, J. Tillich, N. Sendrier, Paulo Barreto (2013)
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes2013 IEEE International Symposium on Information Theory
Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-joon Shin (2007)
Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$IEEE Transactions on Information Theory, 53
B. Vasic, O. Milenkovic (2002)
Combinatorial constructions of low-density parity-check codes for iterative decodingIEEE Transactions on Information Theory, 50
N. Kamiya (2005)
High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine PlanesIEEE Transactions on Information Theory, 53
M. Fossorier (2004)
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Trans. Inf. Theory, 50
R. Townsend, E. Weldon (1967)
Self-orthogonal quasi-cyclic codesIEEE Trans. Inf. Theory, 13
D. Mackay, M. Davey (2001)
Evaluation of Gallager Codes for Short Block Length and High Rate Applications, 123
J. Thorpe, K. Andrews, S. Dolinar (2004)
Methodologies for designing LDPC codes using protographs and circulantsInternational Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
Xiao-Yu Hu, E. Eleftheriou, D. Arnold (2005)
Regular and irregular progressive edge-growth tanner graphsIEEE Transactions on Information Theory, 51
[In this chapter, we describe the main characteristics of a hybrid class of codes which are both quasi-cyclic (QC) and low-density parity-check (LDPC) codes. They join the powerful error correcting performance of LDPC codes with the structured nature of QC codes, which allows for very compact representations. This, together with the high number of equivalent codes, makes these codes well suited for cryptographic applications. This chapter addresses the design of these codes, as well as the estimation of the number of different codes having the same parameters.]
Published: May 3, 2014
Keywords: QC-LDPC codes; QC-MDPC codes; Difference families; Equivalent codes
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.