Chain of Separable Binary Goppa Codes and their Minimal Distance

Sergey Bezzateev; Natalia Shekhunova

Chain of Separable Binary Goppa Codes and their Minimal Distance

Information Theory 2007-07-30 v1 math.IT

Authors: Sergey Bezzateev , Natalia Shekhunova

Abstract

It is shown that subclasses of separable binary Goppa codes, $\Gamma(L,G)$ - codes, with $L=\{\alpha \in GF(2^{2l}):G(\alpha)\neq 0 \}$ and special Goppa polynomials G(x) can be presented as a chain of embedded codes. The true minimal distance has been obtained for all codes of the chain.

Keywords

maximum distance separable code coding theory

Cite

@article{arxiv.0707.4083,
  title  = {Chain of Separable Binary Goppa Codes and their Minimal Distance},
  author = {Sergey Bezzateev and Natalia Shekhunova},
  journal= {arXiv preprint arXiv:0707.4083},
  year   = {2007}
}

Comments

7 pages, 1 figure

Related papers

View all related →