vector ) quotient = Mod2Polynomial ( * ( max ( self. vector : vector = ( vector ( p1 * p2 )) % 2 i2 = 1 i1 = 1 return Mod2Polynomial ( vector ) def _mod_ ( self, divisor ): def make_monomial ( n ): vector = * ( n 1 ) vector = 1 return Mod2Polynomial ( vector ) dividend = Mod2Polynomial ( self. ![]() get_order () 2 ) i1 = 0 for p1 in self. is_zero (): return Mod2Polynomial () vector = * ( self. vector )) return Mod2Polynomial () def _mul_ ( self, polynomial ): if self. join ( reversed ( polynomial_string )) if polynomial_string else "0" def _add_ ( self, polynomial ): size = max ( self. vector ))) polynomial_string = filter ( bool, ) return " ". format ( order ) else : return "1" indexed_coefficients = zip ( self. ![]() vector = int ( bool ( p )) i = 1 def _str_ ( self ): def monomial_str ( order ): if order = 1 : return "x" elif order > 0 : return "x^". vector = * len ( vector ) i = 0 for p in vector : self. I wrote a python script which can calculate multiplication tables for \(GF(2^3)\) fields (the class has since been split into a module): class Mod2Polynomial : def _init_ ( self, vector ): while len ( vector ) and not vector : vector.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |