Results 11 to 20 of about 29,101,112 (306)
Good Quantum LDPC Codes with Linear Time Decoders [PDF]
Symposium on the Theory of Computing, 2022 We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain (2m× m)V →δ0 (2m)E →δ1 2F where V (X-checks) are the vertices, E (qubits) are ...
Irit Dinur +3 more
semanticscholar +1 more source
Two families of negacyclic BCH codes [PDF]
Designs, Codes and Cryptography, 2022 Negacyclic BCH codes are a subclass of neagcyclic codes and are the best linear codes in many cases. However, there have been very few results on negacyclic BCH codes. Let q be an odd prime power and m be a positive integer.
Xiaoqiang Wang, Zhonghua Sun, C. Ding
semanticscholar +1 more source
Some Punctured Codes of Several Families of Binary Linear Codes [PDF]
IEEE Transactions on Information Theory, 2021 Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal {C}(f)=\{ {\mathrm{ Tr}}({\textit{af}}({x})+{\textit{bx}})_{x \in \mathbb {F}_{q^{m}}^{*}}: {
Xiaoqiang Wang, Dabin Zheng, C. Ding
semanticscholar +1 more source
Reed–Muller Codes: Theory and Algorithms [PDF]
IEEE Transactions on Information Theory, 2020 Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science.
E. Abbe, Amir Shpilka, Min Ye
semanticscholar +1 more source
New quantum codes from constacyclic codes over the ring Rk, m
Advances in Mathematics of Communications, 2022 For any odd prime \begin{document}$ p $\end{document} , we study constacyclic codes of length \begin{document}$ n $\end{document} over the finite commutative non-chain ring \begin{document}$ R_{k,m} = \mathbb{F}_{p^m}[u_1,u_2,\dots,u_k]/\langle u^2_i-1 ...
Habibul Islam +2 more
semanticscholar +1 more source
Surface codes: Towards practical large-scale quantum computation [PDF]
, 2012 This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer, using two qubits, and extend this concept to stabilizers ...
A. Fowler +3 more
semanticscholar +1 more source
Codes for Natural History Collections in Ichthyology and Herpetology
Copeia, 2020 Assembled here is a reasonably complete list of annotated codes for historical and modern natural history collections associated with lost and extant specimens of fossil and Recent fishes, amphibians, and reptiles.
M. Sabaj
semanticscholar +1 more source
b-Symbol Distance of Constacylic Codes of Length ps Over Fpm + uFpm
IEEE Access, 2020 In this research paper, the repeated-root constacyclic codes over the chain ring Fpm + uFpm are considered, where p is a prime and m > 0 is any integer. The b-symbol distance for prime power length, i.e.
H. Q. Dinh +4 more
doaj +1 more source
The Gilbert-Varshamov Bound for Stabilizer Codes Over
IEEE Access, 2018 Quantum codes over finite rings have received a great deal of attention in recent years. Compared with quantum codes over finite fields, a notable advantage of quantum codes over finite rings is that they can adapt to quantum physical systems of ...
Nianqi Tang +3 more
doaj +1 more source
Non-restrictive MDS Array Codes for Correcting Multiple Column Erasures
Journal of King Saud University: Engineering Sciences, 2004 A new family of MDS array codes of size m × n, that we call Br (m, n, t), for correcting multiple column erasures is proposed. Br(m, n, t) codes achieve the maximum possible correcting capability, i.e., they are MDS codes with dmin = r + 1.
A.M. Al-Shahrani, A.K. Al-Jabri
doaj +1 more source