Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Bariffi, Jessica"'
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a distribution rela
Externí odkaz:
http://arxiv.org/abs/2404.10666
Most low-density parity-check (LDPC) code constructions are considered over finite fields. In this work, we focus on regular LDPC codes over integer residue rings and analyze their performance with respect to the Lee metric. Their error-correction pe
Externí odkaz:
http://arxiv.org/abs/2312.14674
Autor:
Bariffi, Jessica, Weger, Violetta
This paper provides new and improved Singleton-like bounds for Lee metric codes over integer residue rings. We derive the bounds using various novel definitions of generalized Lee weights based on different notions of a support of a linear code. In t
Externí odkaz:
http://arxiv.org/abs/2307.06079
The Lee metric syndrome decoding problem is an NP-hard problem and several generic decoders have been proposed. The observation that such decoders come with a larger cost than their Hamming metric counterparts make the Lee metric a promising alternat
Externí odkaz:
http://arxiv.org/abs/2205.12903
The problem of scalar multiplication applied to vectors is considered in the Lee metric. Unlike in other metrics, the Lee weight of a vector may be increased or decreased by the product with a nonzero, nontrivial scalar. This problem is of particular
Externí odkaz:
http://arxiv.org/abs/2110.01878
We study the performance of nonbinary low-density parity-check (LDPC) codes over finite integer rings over two channels that arise from the Lee metric. The first channel is a discrete memory-less channel (DMC) matched to the Lee metric. The second ch
Externí odkaz:
http://arxiv.org/abs/2105.08372
A new construction for moderate density parity-check (MDPC) codes using finite geometry is proposed. We design a parity-check matrix for this family of binary codes as the concatenation of two matrices: the incidence matrix between points and lines o
Externí odkaz:
http://arxiv.org/abs/2103.09722
Publikováno v:
GLOBECOM 2022 - 2022 IEEE Global Communications Conference.
We study the performance of nonbinary low-density parity-check (LDPC) codes over finite integer rings over two channels that arise from the Lee metric. The first channel is a discrete memory-less channel (DMC) matched to the Lee metric. The second ch
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.