Abstract: We show that it is possible to break up Higher Grassmann codes we constructed in earlier work to a sequence of affine Reed-Muller codes so that various operations can be reduced to ...
There was an error while loading. Please reload this page.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback