Abstract
Described in this paper are two different methods of forcing greedy codes to be linear over arbitrary finite fields. Both methods are generalizations of the binary B-greedy codes as well as the triangular greedy codes over arbitrary fields. One method generalizes to arbitrary orderings over 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. These examples give codes similar to triangular codes from B-orderings. Both methods are shown to be substantially different.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
