[图书][B] Concise encyclopedia of coding theory
Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Dihedral codes with prescribed minimum distance
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which
allows to store them efficiently. In this paper, we investigate it and prove some lower bounds …
allows to store them efficiently. In this paper, we investigate it and prove some lower bounds …
On generalized Reed–Solomon codes over commutative and noncommutative rings
G Quintin, M Barbier, C Chabot - IEEE transactions on …, 2013 - ieeexplore.ieee.org
In this paper, we study generalized Reed-Solomon codes (GRS codes) over commutative
and noncommutative rings, we show that the classical Welch-Berlekamp and Guruswami …
and noncommutative rings, we show that the classical Welch-Berlekamp and Guruswami …
Dihedral Quantum Codes
N Willenborg, M Borello, AL Horlemann… - arXiv preprint arXiv …, 2023 - arxiv.org
We establish dihedral quantum codes of short block length, a class of CSS codes obtained
by the lifted product construction. We present the code construction and give a formula for …
by the lifted product construction. We present the code construction and give a formula for …
Spectral method for quasi-cyclic code analysis
P Semenov, P Trifonov - IEEE communications letters, 2012 - ieeexplore.ieee.org
Spectral Method for Quasi-Cyclic Code Analysis Page 1 1840 IEEE COMMUNICATIONS
LETTERS, VOL. 16, NO. 11, NOVEMBER 2012 Spectral Method for Quasi-Cyclic Code Analysis …
LETTERS, VOL. 16, NO. 11, NOVEMBER 2012 Spectral Method for Quasi-Cyclic Code Analysis …
[HTML][HTML] On the girth of Tanner (3, 11) quasi-cyclic LDPC codes
H Xu, B Bai, D Feng, C Sun - Finite Fields and Their Applications, 2017 - Elsevier
Motivated by the works on the girth of Tanner (3, 5) and (3, 7) quasi-cyclic (QC) low-density
parity-check (LDPC) codes done by S. Kim et al. and M. Gholami et al., respectively, we …
parity-check (LDPC) codes done by S. Kim et al. and M. Gholami et al., respectively, we …
On reversibility and self-duality for some classes of quasi-cyclic codes
RT Eldin, H Matsui - IEEE Access, 2020 - ieeexplore.ieee.org
In this work, we study two classes of quasi-cyclic (QC) codes and examine how several
properties can be combined into the codes of these classes. We start with the class of QC …
properties can be combined into the codes of these classes. We start with the class of QC …
On the algebraic structure of quasi-polycyclic codes and new quantum codes
O Hassan, N Mustapha, A Nuh - Quantum Information Processing, 2024 - Springer
In this paper, we are interested in right (resp., left) quasi-polycyclic (QP) codes of length n=
m ℓ with an associated vector a=(a 0, a 1,…, am-1)∈ F qm, which are a generalization of …
m ℓ with an associated vector a=(a 0, a 1,…, am-1)∈ F qm, which are a generalization of …
Partial Permutation Decoding for Several Families of Linear and -Linear Codes
RD Barrolleta, M Villanueva - IEEE Transactions on Information …, 2018 - ieeexplore.ieee.org
A general criterion to obtain s-PD-sets of minimum size s+ 1 for partial permutation
decoding, which enable correction up to s errors, for systematic codes over a finite field Fq …
decoding, which enable correction up to s errors, for systematic codes over a finite field Fq …
On the locality of quasi-cyclic codes over finite fields
C Rajput, M Bhaintwal - Designs, Codes and Cryptography, 2022 - Springer
A code is said to have locality r if any coordinate value in a codeword of that code can be
recovered by at most r other coordinates. In this paper, we have studied the locality of quasi …
recovered by at most r other coordinates. In this paper, we have studied the locality of quasi …