• Journal of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1167-1182
• /
• 2010

We study codes meeting a generalized version of the Singleton bound for higher weights. We show that some of the higher weight enumerators of these codes are uniquely determined. We give the higher weight enumerators for MDS codes, the Simplex codes, the Hamming codes, the first order Reed-Muller codes and their dual codes. For the putative [72, 36, 16] code we find the i-th higher weight enumerators for i = 12 to 36. Additionally, we give a version of the generalized Singleton bound for non-linear codes.

• Korean Journal of Mathematics
• /
• v.9 no.2
• /
• pp.129-131
• /
• 2001

Let $q=p^{e1}_1{\cdots}p^{em}_m$ be the product of distinct prime elements. In this short paper, we show that the largest value of M such that there exists an ($n$, M, $n-1$) $q$-ary code is $q^2$ if $n-1{\leq}p^{ei}_i$ for all $i$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1671-1683
• /
• 2016

Locally repairable codes (LRCs) constitute an important class of codes for distributed storage, where repair efficiency is a key metric of system performance. In LRCs, efficient repair is achieved by small locality-number of nodes participating in the repair process. In this paper, we focus on situations where different locality is required for different nodes. We present a non-trivial extension of the recent results on multiple (or unequal) localities to the $r,{\delta}$-locality case. A new Singleton-type minimum distance upper bound is derived and an optimal code construction is provided. While the result is limited to the case of only two different localities, it should be noted that it can be directly applied to the more general case where the localities are specified not exactly but by upper limits.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1235-1255
• /
• 2019

In this paper, we introduce SR-additive codes as a generalization of the classes of ${\mathbb{Z}}_{p^r}{\mathbb{Z}}_{p^s}$ and ${\mathbb{Z}}_2{\mathbb{Z}}_2[u]$-additive codes, where S is an R-algebra and an SR-additive code is an R-submodule of $S^{\alpha}{\times}R^{\beta}$. In particular, the definitions of bilinear forms, weight functions and Gray maps on the classes of ${\mathbb{Z}}_{p^r}{\mathbb{Z}}_{p^s}$ and ${\mathbb{Z}}_2{\mathbb{Z}}_2[u]$-additive codes are generalized to SR-additive codes. Also the singleton bound for SR-additive codes and some results on one weight SR-additive codes are given. Among other important results, we obtain the structure of SR-additive cyclic codes. As some results of the theory, the structure of cyclic ${\mathbb{Z}}_2{\mathbb{Z}}_4$, ${\mathbb{Z}}_{p^r}{\mathbb{Z}}_{p^s}$, ${\mathbb{Z}}_2{\mathbb{Z}}_2[u]$, $({\mathbb{Z}}_2)({\mathbb{Z}}_2+u{\mathbb{Z}}_2+u^2{\mathbb{Z}}_2)$, $({\mathbb{Z}}_2+u{\mathbb{Z}}_2)({\mathbb{Z}}_2+u{\mathbb{Z}}_2+u^2{\mathbb{Z}}_2)$, $({\mathbb{Z}}_2)({\mathbb{Z}}_2+u{\mathbb{Z}}_2+v{\mathbb{Z}}_2)$ and $({\mathbb{Z}}_2+u{\mathbb{Z}}_2)({\mathbb{Z}}_2+u{\mathbb{Z}}_2+v{\mathbb{Z}}_2)$-additive codes are presented.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.875-894
• /
• 2017

Let $[n]=\{1,2,{\ldots},n\}$. A set ${\mathbf{A}}=\{A_1,A_2,{\ldots},A_l\}$ is a minimal cover of [n] if ${\cup}_{1{\leq}i{\leq}l}A_i=[n]$ and $$\bigcup_{{1{\leq}i{\leq}l,}\\{i{\neq}j_0}}A_i{\neq}[n]\text{ for all }j_0{\in}[l]$$. Let ${\mathcal{C}}(n)$ denote the collection of all minimal covers of [n], and write $C_n={\mid}{\mathcal{C}}(n){\mid}$. Let ${\mathbf{A}}{\in}{\mathcal{C}}(n)$. An element $u{\in}[n]$ is critical in ${\mathbf{A}}$ if it appears exactly once in ${\mathbf{A}}$. Two minimal covers ${\mathbf{A}},{\mathbf{B}}{\in}{\mathcal{C}}(n)$ are said to be restricted t-intersecting if they share at least t sets each containing an element which is critical in both ${\mathbf{A}}$ and ${\mathbf{B}}$. A family ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is said to be restricted t-intersecting if every pair of distinct elements in ${\mathcal{A}}$ are restricted t-intersecting. In this paper, we prove that there exists a constant $n_0=n_0(t)$ depending on t, such that for all $n{\geq}n_0$, if ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is restricted t-intersecting, then ${\mid}{\mathcal{A}}{\mid}{\leq}{\mathcal{C}}_{n-t}$. Moreover, the bound is attained if and only if ${\mathcal{A}}$ is isomorphic to the family ${\mathcal{D}}_0(t)$ consisting of all minimal covers which contain the singleton parts $\{1\},{\ldots},\{t\}$. A similar result also holds for restricted r-cross intersecting families of minimal covers.