Self-Orthogonal Greedy Codes

  • Authors:

  • Laura Monroe

  • Affiliations:

  • Department of Mathematics and Computer Science, University of Illinois at Chicago, Chicago, IL 60657/ monroe@uic.edu

  • Venue:
  • Designs, Codes and Cryptography - Special issue containing papers presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we examine greedily generated self-orthogonal codes. Weshow that they are linear, and discuss several properties whichthey possess. We also look at specific examples of these codes.