نتایج جستجو برای: bound ary value problems

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

Journal: :IEEE Transactions on Communications 2022

In this paper, we propose a novel transmission scheme, called sparse layered MIMO (SL-MIMO), that combines non-orthogonal and singular value decomposition (SVD) precoding. Non-orthogonality in SL-MIMO allows re-using of the eigen-channels which improves spectral efficiency error rate performanc...

Journal: :Journal of Combinatorial Theory, Series A 2021

A permutation σ∈Sn is said to be k-universal or a k-superpattern if for every π∈Sk, there subsequence of σ that order-isomorphic π. simple counting argument shows can only n≥(1/e2+o(1))k2, and Arratia conjectured this lower bound best-possible. Disproving Arratia's conjecture, we improve the trivial by small constant factor. We accomplish designing an efficient encoding scheme patterns appear i...

2016
Yi Liu Hairui Jia Yang Xu Y. XU

This paper focuses on multi-ary α-semantic resolution automated reasoning method based on multi-ary α-resolution principle for lattice-valued propositional logic LP(X) with truth-value in lattice implication algebras. The definitions of the multi-ary α-semantic resolution and multi-ary α-semantic resolution deduction in lattice-valued propositional logic LP(X) are given, respectively, and the s...

2005
Wolfgang Haas Sheridan Houghten

The maximum possible number of codewords in a q-ary code of length n and minimum distance d is denoted Aq(n,d). It is a fundamental problem in coding theory to determine this value for given parameters q, n and d. Codes that attain the maximum are said to be optimal. Unfortunately, for many different values of these parameters, the maximum number of codewords is currently unknown: instead we ha...

2003
Mahesh C. Bhandari Chinnappillai Durairajan

In this paper we determine an upper bound for the covering radius of a q-ary MacDonald codeCk;u(q). Values of nq(4; d), the minimal length of a 4-dimensional q-ary code with minimum distance d is obtained for d = q 1 and q 2. These are used to determine the covering radius of C3;1(q),C3;2(q) and C4;2(q).

Journal: :IEEE Transactions on Information Theory 2005

The class of  $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and  a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...

Journal: :bulletin of the iranian mathematical society 2015
f. z. geng s. p. qian

the aim of this paper is to present a numerical method for singularly perturbed convection-diffusion problems with a delay. the method is a combination of the asymptotic expansion technique and the reproducing kernel method (rkm). first an asymptotic expansion for the solution of the given singularly perturbed delayed boundary value problem is constructed. then the reduced regular delayed diffe...

Journal: :IEICE Transactions 2006
San Ling Ferruh Özbudak

Title Aperiodic and odd correlations of some p-ary sequences from Galois rings correlations of some p-ary sequences from Galois rings. print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of ...

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

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