Results 31 to 40 of about 143,981 (279)
Refined Upper Bounds on Stopping Redundancy of Binary Linear Codes [PDF]
, 2015 The $l$-th stopping redundancy $\rho_l(\mathcal C)$ of the binary $[n, k, d]$ code $\mathcal C$, $1 \le l \le d$, is defined as the minimum number of rows in the parity-check matrix of $\mathcal C$, such that the smallest stopping set is of size at least
Skachek, Vitaly, Yakimenka, Yauhen
core +1 more source
High-Rate Fair-Density Parity-Check Codes [PDF]
ICC 2024 - IEEE International Conference on CommunicationsWe introduce fair-density parity-check (FDPC) codes targeting high-rate applications. In particular, we start with a base parity-check matrix $H_{b}$ of dimension $2\sqrt{n}\times n$, where $n$ is the code block length, and the number of ones in each row
Hessam Mahdavifar
semanticscholar +1 more source
Bounded-Degree Low-Rank Parity-Check Codes [PDF]
IEEE Transactions on Information TheoryLow-rank parity-check (LRPC) codes are the rank-metric analogue of low-density parity-check codes and they found important applications in code-based cryptography.
Ermes Franch, Chunlei Li
semanticscholar +1 more source
Perturbed Adaptive Belief Propagation Decoding for High-Density Parity-Check Codes [PDF]
IEEE Transactions on Communications, 2020 Algebraic codes such as BCH code are receiving renewed interest as their short block lengths and low/no error floors make them attractive for ultra-reliable low-latency communications (URLLC) in 5G wireless networks.
Lijun Deng +6 more
semanticscholar +1 more source
Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix
Journal of Engineering, 2016 the encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure.
Mohammed Kasim Mohammed Al-Haddad
doaj +2 more sources
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
, 2008 In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented.
Chiani, M., Paolini, E.
core +1 more source
Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes
IEEE Transactions on Communications, 2023 In this paper, we consider how to partition the parity-check matrices (PCMs) to reduce the hardware complexity and computation delay for the row layered decoding of quasi-cyclic low-density parity-check (QC-LDPC) codes. First, we formulate the PCM partitioning as an optimization problem, which targets to minimize the maximum column weight of each layer
Teng Lu +4 more
openaire +2 more sources
Carrier phase recovery of LDPC-coded systems based on the likelihood difference algorithm
EURASIP Journal on Advances in Signal Processing, 2023 The problem of blind phase offset recovery of low density parity-check (LDPC)-coded systems is considered in this paper. We propose a new algorithm of phase offset estimation that involves the computation and maximization of a likelihood difference (LD ...
Rodrigue Imad, Sebastien Houcke
doaj +1 more source
Design and Analysis of Time-Invariant SC-LDPC Convolutional Codes With Small Constraint Length
, 2017 In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check (QC-LDPC) block codes and exploit suitable ...
Baldi, Marco +4 more
core +1 more source
Iterative decoding of Gold sequences [PDF]
, 2015 International audienceGold sequences are widely used in communications and positioning systems for synchronization purposes or spread spectrum transmissions. This paper addresses the decoding of the initial state of a Gold sequence.
Brossier, Jean-Marc +3 more
core +2 more sources