• Journal of the Chungcheong Mathematical Society
• /
• 제26권1호
• /
• pp.147-159
• /
• 2013

Hamada ([8]) and Maruta ([17]) proved the minimum length $n_3(6,\;d)=g_3(6,\;d)+1$ for some ternary codes. In this paper we consider such minimum length problem for $q{\geq}4$, and we prove that $n_q(6,\;d)=g_q(6,\;d)+1$ for $d=q^5-q^3-q^2-2q+e$, $1{\leq}e{\leq}q$. Combining this result with Theorem A in [4], we have $n_q(6,\;d)=g-q(6,\;d)+1$ for $q^5-q^3-q^2-2q+1{\leq}d{\leq}q^5-q^3-q^2$ with $q{\geq}4$. Note that $n_q(6,\;d)=g_q(6,\;d)$ for $q^5-q^3-q^2+1{\leq}d{\leq}q^5$ by Theorem 1.2.

• Bulletin of the Korean Mathematical Society
• /
• 제45권3호
• /
• pp.419-425
• /
• 2008

For $q^5-q^3-q^2-q+1{\leq}d{\leq}q^5-q^3-q^2$, we prove the non-existence of a $[g_q(6,d),6,d]_q$ code and we give a $[g_q(6,d)+1,6,d]_q$ code by constructing appropriate 0-cycle in the projective space, where $g_q (k,d)={{\sum}^{k-1}_{i=0}}{\lceil}\frac{d}{q^i}{\rceil}$. Consequently, we have the minimum length $n_q(6,d)=g_q(6,d)+1\;for\;q^5-q^3-q^2-q+1{\leq}d{\leq}q^5-q^3-q^2\;and\;q{\geq}3$.

• Communications of the Korean Mathematical Society
• /
• 제24권3호
• /
• pp.367-379
• /
• 2009

For a prime number p, let $\mathbb{Q}_p$ denote the p-adic field and let $\mathbb{Q}_p^d$ denote a vector space over $\mathbb{Q}_p$ which consists of all d-tuples of $\mathbb{Q}_p$. For a function f ${\in}L_{loc}^1(\mathbb{Q}_p^d)$, we define the Hardy-Littlewood maximal function of f on $\mathbb{Q}_p^d$ by $$M_pf(x)=sup\frac{1}{\gamma{\in}\mathbb{Z}|B_{\gamma}(x)|H}{\int}_{B\gamma(x)}|f(y)|dy$$, where |E|$_H$ denotes the Haar measure of a measurable subset E of $\mathbb{Q}_p^d$ and $B_\gamma(x)$ denotes the p-adic ball with center x ${\in}\;\mathbb{Q}_p^d$ and radius $p^\gamma$. If 1 < q $\leq\;\infty$, then we prove that $M_p$ is a bounded operator of $L^q(\mathbb{Q}_p^d)$ into $L^q(\mathbb{Q}_p^d)$; moreover, $M_p$ is of weak type (1, 1) on $L^1(\mathbb{Q}_p^d)$, that is to say, |{$x{\in}\mathbb{Q}_p^d:|M_pf(x)|$>$\lambda$}|$_H{\leq}\frac{p^d}{\lambda}||f||_{L^1(\mathbb{Q}_p^d)},\;\lambda$ > 0 for any f ${\in}L^1(\mathbb{Q}_p^d)$.

• Bulletin of the Korean Mathematical Society
• /
• 제54권3호
• /
• pp.731-736
• /
• 2017

It is well-known that there exists a constant-weight $[s{\theta}_{k-1},k,sq^{k-1}]_q$ code for any positive integer s, which is an s-fold simplex code, where ${\theta}_j=(q^{j+1}-1)/(q-1)$. This gives an upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+n_q(k,d)$ for any positive integer d, where $n_q(k,d)$ is the minimum length n for which an $[n,k,d]_q$ code exists. We construct a two-weight $[s{\theta}_{k-1}+1,k,sq^{k-1}]_q$ code for $1{\leq}s{\leq}k-3$, which gives a better upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+1+n_q(k-1,d)$ for $1{\leq}d{\leq}q^s$. As another application, we prove that $n_q(5,d)={\sum_{i=0}^{4}}{\lceil}d/q^i{\rceil}$ for $q^4+1{\leq}d{\leq}q^4+q$ for any prime power q.

• Journal of the Chungcheong Mathematical Society
• /
• 제35권3호
• /
• pp.227-234
• /
• 2022

Let 𝔽_q be a finite field with odd q elements. In this article, we prove that if E ⊆ 𝔽^d_q, d ≥ 2, and |E| ≥ q, then there exists a set Y ⊆ 𝔽^d_q with |Y| ~ q^d such that for all y ∈ Y, the number of distances between the point y and the set E is ~ q. As a corollary, we obtain that for each set E ⊆ 𝔽^d_q with |E| ≥ q, there exists a set Y ⊆ 𝔽^d_q with |Y| ~ q^d so that any set E ∪ {y} with y ∈ Y determines a positive proportion of all possible distances. The averaging argument and the pigeonhole principle play a crucial role in proving our results.

• Journal of the Chungcheong Mathematical Society
• /
• 제13권1호
• /
• pp.131-138
• /
• 2000

Let D be the open unit disk in the complex plane $\mathbb{C}$. For any q > 0, the operator $Q_q$ defined by $$Q_qf(z)=q\int_{D}\frac{f(\omega)}{(1-z{\bar{\omega}})^{1+q}}d{\omega},\;z{\in}D$$. maps $L^{\infty}(D)$ boundedly onto $B_q$ for each q > 0. In this paper, weighted Bloch spaces $\mathcal{B}_q$ (q > 0) are considered on the open unit ball in $\mathbb{C}^n$. In particular, we will investigate the possibility of extension of this operator to the Weighted Bloch spaces $\mathcal{B}_q$ in $\mathbb{C}^n$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제26권1호
• /
• pp.58-63
• /
• 2022

The daily number of confirmed cases of Coronavirus disease 2019(COVID-19) ranges between 1,000 and 2,000. Despite higher vaccination rates, the number of confirmed cases continues to increase. The Mu variant of COVID-19 reported in some countries by WHO has been identified in Korea. In this study, we predicted the number of confirmed COVID-19 cases in Korea using the SARIMA for the Covid-19 prevention strategy. Trends and seasonality were observed in the data, and the ADF Test and KPSS Test was used accordingly. Order determination of the SARIMA(p,d,q)(P, D, Q, S) model helped in extracting the values of p, d, q, P, D, and Q parameters. After deducing the p and q parameters using ACF and PACF, the data were transformed and schematized into stationary forms through difference, log transformation, and seasonality removal. If seasonality appears, first determine S, then SARIMA P, D, Q, and finally determine ARIMA p, d, q using ACF and PACF for the order excluding seasonality.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.455-462
• /
• 2012

The cyclic group $Cn={\langle}(12{\cdots}n){\rangle}$ acts on the set ($^{[n]}_k$) of all $k$-subsets of [$n$]. In this action of $C_n$ the number of orbits of size $d$, for $d|n$, is $$O^{n,k}_d=\frac{1}{d}\sum_{\frac{n}{d}|s|n}{\mu}(\frac{ds}{n})(^{n/s}_{k/s})$$. Stanton and White[7] generalized the above identity to construct the orbit polynomials $$O^{n,k}_d(q)=\frac{1}{[d]_{q^{n/d}}}\sum_{\frac{n}{d}|s|n}{\mu}(\frac{ds}{n})[^{n/s}_{k/s}]{_q}^s$$ and conjectured that $O^{n,k}_d(q)$ have non-negative coefficients. In this paper we give a combinatorial proof for the positivity of coefficients of the orbit polynomial $O^{n,3}_d(q)$.

• Korean Journal of Mathematics
• /
• 제25권3호
• /
• pp.349-358
• /
• 2017

The cyclic group $C_n={\langle}(12{\cdots}n){\rangle}$ acts on the set $(^{[n]}_k)$ of all k-subsets of [n]. In this action of $C_n$ the number of orbits of size d, for d | n, is $$O^{n,k}_d={\frac{1}{d}}{\sum\limits_{{\frac{n}{d}}{\mid}s{\mid}n}}{\mu}({\frac{ds}{n}})(^{n/s}_{k/s})$$. Stanton and White [6] generalized the above identity to construct the orbit polynomials $$O^{n,k}_d(q)={\frac{1}{[d]_{q^{n/d}}}}{\sum\limits_{{\frac{n}{d}}{\mid}s{\mid}n}}{\mu}({\frac{ds}{n}})[^{n/s}_{k/s}]_{q^s}$$ and conjectured that $O^{n,k}_d(q)$ have non-negative coefficients. In this paper we give a constructive proof for the positivity of coefficients of the orbit polynomial $O^{n,2}_d(q)$.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제65권8호
• /
• pp.1355-1361
• /
• 2016

The inter-turn fault (ITF) causes the negative sequence components in the d -q voltage equation due to an increase in the unbalance of three-phase input currents. For this reason, d -q voltage equation become complicate as the voltage equation is classified into positive and negative components. In this study, we propose a simplified d -q equivalent circuit of an interior permanent magnet synchronous motor under ITF state. First, we proposed modeling method for d -q current based on the finite element method simulation results. Then, we developed the simplified d -q equivalent circuit by applying the proposed d -q current modeling.