Results 261 to 270 of about 35,710 (296)
Phage Display Driven Identification and Computational Mapping of Macrocyclic Peptides Targeting RhoA G17V. [PDF]
BiochemistryAbraham S +8 more
europepmc +1 more source
Utilising unsupervised machine learning to predict outbreaks of respiratory tract infections in acute Irish hospitals (2016-2021). [PDF]
Public Health Pract (Oxf)Amin D, Vellinga A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Information Theory, 1965
A new class of cyclic codes, cyclic product codes, is characterized. These codes enjoy the implementation advantages of cyclic codes and, in addition, possess the important structural properties of product (iterated) codes. The main results are as follows: \begin{enumerate} \item Conditions are given which ensure that the product of two, and, hence ...
H. C. Burton, Edward J. Weldon Jr.
exaly +2 more sources
A new class of cyclic codes, cyclic product codes, is characterized. These codes enjoy the implementation advantages of cyclic codes and, in addition, possess the important structural properties of product (iterated) codes. The main results are as follows: \begin{enumerate} \item Conditions are given which ensure that the product of two, and, hence ...
H. C. Burton, Edward J. Weldon Jr.
exaly +2 more sources
Discrete MathematicsBCH codes are a subclass of cyclic codes with many interesting properties. Over the last sixty years, a lot of progress has been made in the study of BCH codes. This survey paper presents the state-of-the-art of BCH cyclic codes and their applications.
Ding, Cunsheng, Li, Chengju
openaire +4 more sources
On the number of ℤp-double cyclic codes and quasi cyclic codes
Journal of Algebra and Its Applications, 2023In this paper, we study the class of [Formula: see text]-double cyclic codes of length [Formula: see text] We give a closed formula for the number of [Formula: see text] -double cyclic codes of length [Formula: see text] for any integers [Formula: see text] and [Formula: see text] that are relatively prime to [Formula: see text] Moreover, we give a ...
AYDOĞDU, İsmail +3 more
openaire +2 more sources
2015 IEEE International Symposium on Information Theory (ISIT), 2015
Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2-by-2 matrices and it was extended to larger matrices by Sasoglu et al. in 2010.
Narayanan Rengaswamy, Henry D. Pfister
openaire +1 more source
Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2-by-2 matrices and it was extended to larger matrices by Sasoglu et al. in 2010.
Narayanan Rengaswamy, Henry D. Pfister
openaire +1 more source
2013 IEEE International Symposium on Information Theory, 2013
This paper considers cyclic DNA codes of arbitrary length over the ring R = F2[u]/(u4 - 1). A mapping is given between the elements of R and the alphabet {A, C, G, T} which allows the additive stem distance to be extended to this ring. Then, cyclic codes over R are designed such that their images under the mapping are also cyclic or quasi-cyclic of ...
Kenza Guenda +2 more
openaire +1 more source
This paper considers cyclic DNA codes of arbitrary length over the ring R = F2[u]/(u4 - 1). A mapping is given between the elements of R and the alphabet {A, C, G, T} which allows the additive stem distance to be extended to this ring. Then, cyclic codes over R are designed such that their images under the mapping are also cyclic or quasi-cyclic of ...
Kenza Guenda +2 more
openaire +1 more source
IEEE Transactions on Information Theory, 2013
In this paper, the minimum weight and the dimension of all cyclic codes of length pn over a field Fq, are computed, when p is an odd prime and Fq a finite field with q elements, assuming that Fq generates the group of invertible elements of Zpn. Furthermore, the minimum weight and dimension of codes which are sum of two minimal codes in Fq(Cp×Cp) are ...
César Polcino Milies +1 more
openaire +1 more source
In this paper, the minimum weight and the dimension of all cyclic codes of length pn over a field Fq, are computed, when p is an odd prime and Fq a finite field with q elements, assuming that Fq generates the group of invertible elements of Zpn. Furthermore, the minimum weight and dimension of codes which are sum of two minimal codes in Fq(Cp×Cp) are ...
César Polcino Milies +1 more
openaire +1 more source