LINEAR CODES OVER Z4 USING ALMOST-GREEDY ALGORITHM

S. Azab, M Zayed, M. Atrash, M. Ashker

Abstract


In this paper we prove thate the almost-greedy and almost self- orthogonal greedy codes over Z4 with Lee distance are linear when they are generated by using the B-ordering and the almost-greedy algorithm of any ordered basis over Z4

Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 IUG Journal for Natural and Engineering Studies