Results 11 to 20 of about 13,426 (200)

BCH convolutional codes [PDF]

open access: yesIEEE Transactions on Information Theory, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joachim Rosenthal
exaly   +3 more sources

Quantum Convolutional BCH Codes [PDF]

open access: yes2007 10th Canadian Workshop on Information Theory (CWIT), 2007
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes.
Aly, Salah A.   +4 more
core   +2 more sources

On Primitive BCH Codes with Unequal Error Protection Capabilities [PDF]

open access: yes, 1995
Presents a class of binary primitive BCH codes that have unequal-error-protection (UEP) capabilities. The authors use a previous result on the span of their minimum weight vectors to show that binary primitive BCH codes, containing second-order punctured
Lin, Shu, Morelos-Zaragoza, Robert H
core   +2 more sources

A parallel Viterbi decoder for block cyclic and convolution codes [PDF]

open access: yes, 2005
We present a parallel version of Viterbi's decoding procedure, for which we are able to demonstrate that the resultant task graph has restricted complexity in that the number of communications to or from any processor cannot exceed 4 for BCH codes.
Amarasinghe, Kosala, Reeve, Jeffrey
core   +2 more sources

Ternary Primitive LCD BCH codes

open access: yesAdvances in Mathematics of Communications, 2023
16 pages.
Huang, Xinmei   +3 more
openaire   +3 more sources

Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance [PDF]

open access: yes, 2004
Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n grows while q and d are fixed.
Dumer, Ilya, Yekhanin, Sergey
core   +3 more sources

Sequences of Primitive and Non-primitive BCH Codes

open access: yesTrends in Computational and Applied Mathematics, 2018
In this work, we introduce a method by which it is established that; how a sequence of non-primitive BCH codes can be obtained by a given primitive BCH code.
A. S. Ansari   +3 more
doaj   +1 more source

Error Probability Mitigation in Quantum Reading Using Classical Codes

open access: yesEntropy, 2021
A general framework describing the statistical discrimination of an ensemble of quantum channels is given by the name quantum reading. Several tools can be applied in quantum reading to reduce the error probability in distinguishing the ensemble of ...
Francisco Revson Fernandes Pereira   +1 more
doaj   +1 more source

Asymmetric Entanglement-Assisted Quantum Error-Correcting Codes and BCH Codes

open access: yesIEEE Access, 2020
The concept of asymmetric entanglement-assisted quantum error-correcting code (asymmetric EAQECC) is introduced in this article. Codes of this type take advantage of the asymmetry in quantum errors since phase-shift errors are more probable than qudit ...
Carlos Galindo   +3 more
doaj   +1 more source

The q-Ary Antiprimitive BCH Codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2022
It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite fields and analyse their parameters.
Hongwei Zhu   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy