You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A finite ring R is said to be a chain ring, if its set of left ideals form a chain.
This class of rings is very important in coding theory since it contains
finite fields, integer residue rings of prime power order and Galois rings.
This is a first attempt to implement these rings. Furthermore this patch provides a class
FiniteRing_base
which stores the arithmetic of finite rings in tables.
A finite ring R is said to be a chain ring, if its set of left ideals form a chain.
This class of rings is very important in coding theory since it contains
finite fields, integer residue rings of prime power order and Galois rings.
This is a first attempt to implement these rings. Furthermore this patch provides a class
FiniteRing_base
which stores the arithmetic of finite rings in tables.
CC: @burcin @wdjoyner @sagetrac-dlucas
Component: algebra
Keywords: finite chain rings
Author: Thomas Feulner
Issue created by migration from https://trac.sagemath.org/ticket/13398
The text was updated successfully, but these errors were encountered: