Construction of quasi-cyclic LDPC codes based on the minimum weight codewords of reed-solomon codes

Autor:	null Lei Chen, I. Djurdjevic, null Shu Lin, K. Abdel-Ghaffar, null Jun Xu
Rok vydání:	2004
Předmět:	Discrete mathematics Block code Reed–Solomon error correction Concatenated error correction code Reed–Muller code Tornado code Data_CODINGANDINFORMATIONTHEORY Serial concatenated convolutional codes Hardware_ARITHMETICANDLOGICSTRUCTURES Linear code Expander code Mathematics
Zdroj:	ISIT
DOI:	10.1109/isit.2004.1365276
Popis:	This work presents an algebraic method for constructing QC-LDPC codes based on the minimum-weight (m-w) codewords of Reed-Solomon (RS) codes over GF(q) with two information symbols.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b87938ac7867b317c2a2777c649c4075 https://doi.org/10.1109/isit.2004.1365276 Zobrazit plný text záznamu