2026-06-27T23:39:39Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/444552023-07-17T22:37:01Zcom_20.500.14352_14col_20.500.14352_15

00925njm 22002777a 4500 dc Elkouss, David author Martínez Mateo, Jesús author Martín, Vicente author 2012 Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols. 2162-2337 10.1109/WCL.2012.082712.120531 https://hdl.handle.net/20.500.14352/44455 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6290312 Untainted Puncturing for Irregular Low-Density Parity-Check Codes