Constructions and families of covering codes and saturated sets of points in projective geometry

@article{Davydov1995ConstructionsAF,
  title={Constructions and families of covering codes and saturated sets of points in projective geometry},
  author={Alexander A. Davydov},
  journal={IEEE Trans. Information Theory},
  year={1995},
  volume={41},
  pages={2071-2080}
}
In a recent paper by this author, constructions of linear binary covering codes are considered. In this work, constructions and techniques of the earlier paper are developed and modified for q-ary linear nonbinary covering codes, q 2 3, and new constructions are proposed. The described constructions design an infinite family of codes with covering radius R based on a starting code of the same covering radius. For arbitrary R 2 2, q 1 3, new infinite families of nonbinary covering codes with… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 27 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Codes with covering radius 2 and other new covering codes

  • N. J. A. Sloane
  • IEEE Trans . Inform . Theory
  • 1991

Constructions and families of qary linear covering codes and saturated sets of points in projective geometry

  • A. Yu. Drbzhzhina-Labinskaya
  • English translation in Probl . Inform . Transm .
  • 1991

Similar Papers

Loading similar papers…