نتایج جستجو برای: ary polygroup

تعداد نتایج: 4459  

2013
S. M. ANVARIYEH B. DAVVAZ

In this paper, we define the strongly compatible relation ε on the (m,n)ary hypermodule M, so that the quotient (M/ε∗, h/ε∗) is an (m,n)-ary module over the fundamental (m,n)-ary ring (R/Γ∗, f/Γ∗, g/Γ∗). Also, we determine a family P (M) of subsets of an (m,n)-ary hypermodule M and we give a sufficient condition such that the geometric space (M,P (M)) is strongly transitive. Mathematics Subject...

2003
Young - Sik Kim Ji - Woong Jang Tor Helleseth

In this paper, using bent functions defined on the finite field, we generalized the construction method of the family of p-ary bent sequences with balanced and optimal correlation property introduced by Kumar and Moreno for an odd prime p [3], called a generalized p-ary bent sequence. It turns out that the family of balanced p-ary sequences with optimal correlation property introduced by Moriuc...

Journal: :CoRR 2011
Qiang Zhu Xinke Wang Juanjuan Ren

The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary ncube is an important interconnection network of parallel computing systems. The 1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for k ≥ 4 in [6]. Nevertheless, the h-extra connectivity of 3-ary ncubes has not been obt...

2004
Nikolaos S. Avlonitis Eric M. Yeatman

This effort focuses on the comparison of On Off Keying (OOK) to incoherent 4-ary Amplitude Shift Keying (ASK). We show that a 0.4 bits/s/Hz improvement in spectral efficiency is obtained by utilising 4-ary ASK. We determined the filter steepness required to achieve this maximum obtainable spectral efficiency. The comparison of OOK and 4-ary ASK in terms of dispersion tolerance for Non-Return-to...

Journal: :Photonics 2021

This paper exploits for the first time use of machine learning (ML) based techniques to identify complex structured light patterns under free space optics (FSO) jamming attacks secure FSO-based applications. Five M-ary modulation schemes, construed using Laguerre and Hermite Gaussian (LG HG) mode families, were used in this investigation. These include 8-ary LG, superposition-LG, 16-ary HG, LG ...

2010
C. Lavault

The paper presents a new fast k-ary reduction for integer GCD. It enjoys powerful properties and improves on the running time of the quite similar integer GCD algorithm of Kannan et al. Our k-ary reduction also improves on Sorenson's k-ary reductionn14] and thus favorably matches We-ber's algorithmm15]. More generally, the fast k-ary reduction also provides a basic tool for almost all the best ...

2016
Pinghong Ming Ting Cai Jin Li Yong Ning Shengao Xie Tao Tao Faqing Tang

7-hydroxy-5,4'-dimethoxy-2-arylbenzofuran (Ary) is purified from Livistona. It has been demonstrated to have anticancer activity to various tumors in including cervical cancer, but its mechanism is still unclear. In the present, we show that Ary induces cervical cancer cells apoptosis through mitochondria degradation and mediates cervical cancer cell arrest. Further, Ary-inducing cell cycle G1/...

Journal: :Probl. Inf. Transm. 2007
Victor Zinoviev Josep Rifà

In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...

Journal: :CoRR 2017
Alexander M. Romanov

We consider perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). In this paper, a generalized concatenation construction for q-ary 1-perfect codes is presented that allows us to construct q-ary 1-perfect codes of length (q − 1)nm + n +m from the given q-ary 1-perfect codes of length n = (q1 − 1)/(q − 1) and m = (q2 − 1)/(q − 1), where s1, s2 are ...

Journal: :CoRR 2004
Alex Vinokur

A non-decreasing sequence of positive integer weights P ={p1, p2,..., pn} (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , , ) ( 1 ) ( − = < + N 0 i p p i m i m . Let T be an m-ary tree of size n and M=M(T) b...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید