caa a22 4500 477040861 CHVBK 20180405111317.0 cr unu---uuuuu 170330e19961001xx s 000 0 eng 10.1023/A:1027385806430 doi (NATIONALLICENCE)springer-10.1023/A:1027385806430 Bonn Jeffrey Department of Mathematics, Southern Illinois University, 62901, Carbondale, IL, U.S.A aut Forcing Linearity on Greedy Codes [Elektronische Daten] [Jeffrey Bonn] 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. Kluwer Academic Publishers, 1996 Designs, Codes and Cryptography Kluwer Academic Publishers 9/1(1996-10-01), 39-49 0925-1022 9:1<39 1996 9 10623 https://doi.org/10.1023/A:1027385806430 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1023/A:1027385806430 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Bonn Jeffrey Department of Mathematics, Southern Illinois University, 62901, Carbondale, IL, U.S.A aut NATIONALLICENCE 773 0- Designs, Codes and Cryptography Kluwer Academic Publishers 9/1(1996-10-01), 39-49 0925-1022 9:1<39 1996 9 10623 Metadata rights reserved Springer special CC-BY-NC licence nationallicence SWISSBIB 477040861 BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer