On the public citation graph

Efficient encoding of QC-LDPC codes related to cyclic MDS codes

0 signed · 38 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0019-9958(68)90534-2openalex-snapshot
On the p-rank of the design matrix of a difference set
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1108/03684920410534506openalex-snapshot
Information Theory, Inference, and Learning Algorithms
inferredcites →https://doi.org/10.1109/18.53751openalex-snapshot
Pseudocyclic maximum-distance-separable codes
inferredcites →https://doi.org/10.1109/18.910579openalex-snapshot
Efficient encoding of low-density parity-check codes
inferredcites →https://doi.org/10.1109/18.959255openalex-snapshot
Low-density parity-check codes based on finite geometries: a rediscovery and new results
inferredcites →https://doi.org/10.1109/49.661116openalex-snapshot
On iterative soft-decision decoding of linear binary block codes and product codes
inferredcites →https://doi.org/10.1109/glocom.2007.336openalex-snapshot
Design of High-Rate QC-LDPC Encoder/Decoder for Microwave Radio Systems
inferredcites →https://doi.org/10.1109/isit.2006.261736openalex-snapshot
On the rank of LDPC matrices constructed by Vandermonde matrices and RS codes
inferredcites →https://doi.org/10.1109/lcomm.2003.814716openalex-snapshot
A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols
inferredcites →https://doi.org/10.1109/tcomm.2005.861667openalex-snapshot
Efficient encoding of quasi-cyclic low-density parity-check codes
inferredcites →https://doi.org/10.1109/tcomm.2008.060024openalex-snapshot
Transactions Papers - Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.1972.1054900openalex-snapshot
Number of information symbols in polynomial codes
inferredcites →https://doi.org/10.1109/tit.2004.831841openalex-snapshot
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
inferredcites →https://doi.org/10.1109/tit.2007.892770openalex-snapshot
High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes
inferredcites →https://doi.org/10.1109/tit.2007.899516openalex-snapshot
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
inferredcites →https://doi.org/10.1109/tit.2007.907507openalex-snapshot
Efficient Serial Message-Passing Schedules for LDPC Decoding
inferredcites →https://doi.org/10.5860/choice.41-5949openalex-snapshot
Information theory, inference, and learning algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1049/iet-com.2014.0178openalex-snapshot
Density optimisation of generator matrices of quasi‐cyclic low‐density parity‐check codes and their rank analysis
inferred← citeshttps://doi.org/10.1109/eucnc.2019.8801957openalex-snapshot
An Unnoticed Property in QC-LDPC Codes to Find the Message from the Codeword in Non-Systematic Codes
inferred← citeshttps://doi.org/10.1109/icece.2010.529openalex-snapshot
Study on the Development of Synthesis Evaluation System Based on an Improved Fuzzy-AHP Algorithm
inferred← citeshttps://doi.org/10.1109/isit.2011.6034147openalex-snapshot
A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2018.8437611openalex-snapshot
Construction of Multiple-Burst-Correction Codes in Transform Domain
inferred← citeshttps://doi.org/10.1109/isita.2010.5649214openalex-snapshot
Circulant decomposition: Cyclic, quasi-cyclic and LDPC codes
inferred← citeshttps://doi.org/10.1109/ita.2010.5454149openalex-snapshot
Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices
inferred← citeshttps://doi.org/10.1109/ita.2014.6804249openalex-snapshot
Low complexity encoding algorithm of RS-based QC-LDPC codes
inferred← citeshttps://doi.org/10.1109/jlt.2015.2482226openalex-snapshot
Overview of the FABULOUS EU Project: Final System Performance Assessment With Discrete Components
inferred← citeshttps://doi.org/10.1109/lcomm.2010.080410.101034openalex-snapshot
Efficiently Encodable Irregular QC-LDPC Codes Constructed from Self-Reciprocal Generator Polynomials of MDS Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2010.091710.090721openalex-snapshot
Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares
inferred← citeshttps://doi.org/10.1109/tcomm.2011.060911.100208openalex-snapshot
Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields
inferred← citeshttps://doi.org/10.1109/tcomm.2013.090213.120763openalex-snapshot
Pilot-Symbol Assisted and Code-Aided Phase Error Estimation for High-Order QAM Transmission
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2948341openalex-snapshot
Construction of Multiple-Burst-Correction Codes in Transform Domain and Its Relation to LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2179842openalex-snapshot
Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets
inferred← citeshttps://doi.org/10.1109/tit.2012.2184834openalex-snapshot
A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes
inferred← citeshttps://doi.org/10.1364/ofc.2010.othl2openalex-snapshot
Concatenated QC-LDPC and SPC Codes for 100 Gbps Ultra Long-Haul Optical Transmission Systems
inferred← citeshttps://doi.org/10.1587/transcom.e96.b.1402openalex-snapshot
Design and Implementation of Long High-Rate QC-LDPC Codes and Its Applications to Optical Transmission Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1012.3201openalex-snapshot
Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.