On the Griesmer Bound for Systematic Codes

Emanuele Bellini

On the Griesmer Bound for Systematic Codes

Information Theory 2013-10-16 v1 math.IT

Authors: Emanuele Bellini

Abstract

We generalize the Griesmer bound in the case of systematic codes over a field of size q greater than the distance d of the code. We also generalize the Griesmer bound in the case of any systematic code of distance 2,3,4 and in the case of binary systematic codes of distance up to 6.

Keywords

maximum distance separable code coding theory

Cite

@article{arxiv.1310.4060,
  title  = {On the Griesmer Bound for Systematic Codes},
  author = {Emanuele Bellini},
  journal= {arXiv preprint arXiv:1310.4060},
  year   = {2013}
}

Related papers

View all related →