Forcing Linearity on Greedy Codes

  • Authors:

  • Jeffrey T. Bonn

  • Affiliations:

  • Department of Mathematics, Southern Illinois University, Carbondale, IL 62901 U.S.A.

  • 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

Described in this paper are two different methods of forcing greedy codesto be linear over arbitrary finite fields. Both methods are generalizationsof the binary B-greedy codes as well as the triangular greedycodes over arbitrary fields. One method generalizes to arbitrary orderingsover arbitrary finite fields while the other method generalizes theB-greedy codes to linear codes over arbitrary finite fields.Examples of the first method are computed for triangular greedy codes. Theseexamples give codes similar to triangular codes from B-orderings.Both methods are shown to be substantially different.