Zobrazeno 1 - 10
of 11 387
pro vyhledávání: '"bch codes"'
Autor:
Li, Guangwen, Yu, Xiao
Effective iterative decoding of short BCH codes faces two primary challenges: identifying an appropriate parity-check matrix and accelerating decoder convergence. To address these issues, we propose a systematic scheme to derive an optimized parity-c
Externí odkaz:
http://arxiv.org/abs/2411.13876
In this paper, we present an infinite family of MDS codes over $\mathbb{F}_{2^s}$ and two infinite families of almost MDS codes over $\mathbb{F}_{p^s}$ for any prime $p$, by investigating the parameters of the dual codes of two families of BCH codes.
Externí odkaz:
http://arxiv.org/abs/2410.15070
Autor:
Yohananov, Lev, Schwartz, Moshe
We completely determine the second covering radius for binary primitive double-error-correcting BCH codes. As part of this process, we provide a lower bound on the second covering radius for binary primitive BCH codes correcting more than two errors.
Externí odkaz:
http://arxiv.org/abs/2409.10420
We characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT) and propose a reduced complexity method for the spectral-domain decoder. Further, we also consider repeated-root constacyclic codes and characte
Externí odkaz:
http://arxiv.org/abs/2407.16814
Autor:
Shany, Yaron, Berman, Amit
In a paper from 2015, Ding et al. (IEEE Trans. IT, May 2015) conjectured that for odd $m$, the minimum distance of the binary BCH code of length $2^m-1$ and designed distance $2^{m-2}+1$ is equal to the Bose distance calculated in the same paper. In
Externí odkaz:
http://arxiv.org/abs/2408.08218
Autor:
Lian, Mengchen
BCH codes are an important class of linear codes and find extensive utilization in communication and disk storage systems.This paper mainly analyzes the negacyclic BCH code and cyclic BCH code of length $\frac{q^m-1}{2}$. For negacyclic BCH code, we
Externí odkaz:
http://arxiv.org/abs/2405.19965
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.
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.
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a polynomial of the f
Externí odkaz:
http://arxiv.org/abs/2402.03965
Autor:
Fu, Yuqing, Liu, Hongwei
Cyclic BCH codes and negacyclic BCH codes form important subclasses of cyclic codes and negacyclic codes, respectively, and can produce optimal linear codes in many cases. To the best of our knowledge, there are few results on the dual codes of cycli
Externí odkaz:
http://arxiv.org/abs/2401.14671