Cumulative-Separable Codes

Sergey Bezzateev; Natalia Shekhunova

Cumulative-Separable Codes

Information Theory 2010-05-11 v1 math.IT

Authors: Sergey Bezzateev , Natalia Shekhunova

Abstract

q-ary cumulative-separable $\Gamma(L,G^{(j)})$ -codes $L=\{ \alpha \in GF(q^{m}):G(\alpha )\neq 0 \}$ and $G^{(j)}(x)=G(x)^{j}, 1 \leq i\leq q$ are considered. The relation between different codes from this class is demonstrated. Improved boundaries of the minimum distance and dimension are obtained.

Keywords

coding theory maximum distance separable code

Cite

@article{arxiv.1005.1524,
  title  = {Cumulative-Separable Codes},
  author = {Sergey Bezzateev and Natalia Shekhunova},
  journal= {arXiv preprint arXiv:1005.1524},
  year   = {2010}
}

Comments

14 pages, 1 figure

Related papers

View all related →