Results 231 to 240 of about 305,381 (270)
Tuning Nanoscale Conductance in Cyclic Molecules via Molecular Length and Anchoring Groups. [PDF]
Nanomaterials (Basel)Alshehab A, Alotaibi T, Ismael AK.
europepmc +1 more source
Synergistic Enhancement of HCF Lifespan in Carbon-Kevlar/Epoxy Hybrid Composites UsingSilica and Graphene Nanoparticles. [PDF]
Polymers (Basel)Voghofi I +2 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 ...
Yıldız, Eda +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, 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.
openaire +1 more source
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.
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
Journal of Cybernetics, 1976
In this paper the phasing aspects are considered in terms of cyclic blocks so that a code word is composed of several blocks, each block having a cyclic structure. The theory is analogically developed as in the classical case.
Sharma, B. D., Kaur, Bhupinder
openaire +2 more sources
In this paper the phasing aspects are considered in terms of cyclic blocks so that a code word is composed of several blocks, each block having a cyclic structure. The theory is analogically developed as in the classical case.
Sharma, B. D., Kaur, Bhupinder
openaire +2 more sources
44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2004
Cyclic linear codes of block length n over a finite field F/sub q/ are linear subspaces of F/sub q//sup n/ that are invariant under a cyclic shift of their coordinates. A family of codes is good if all the codes in the family have constant rate and constant normalized distance (distance divided by block length).
László Babai +2 more
openaire +1 more source
Cyclic linear codes of block length n over a finite field F/sub q/ are linear subspaces of F/sub q//sup n/ that are invariant under a cyclic shift of their coordinates. A family of codes is good if all the codes in the family have constant rate and constant normalized distance (distance divided by block length).
László Babai +2 more
openaire +1 more source