Rework base error handling

[Marvin-Beckmann]

Description

To implement set_submatrix with the smallest possible overhead I have found a quite nice solution, but I need the ability to compare basetypes through a trait.
In that, I decided to model how we currently compare base errors (moduli errors) and made it its own trait.
We lose some precision in the comments, but the stacktrace also gives the information where the respective errors are from, and all the required debug information is still present.

This PR also improves code-maintainability and makes it easier to compare the base types going forward.

This PR implements...

• the CompareBase trait for all matrices and additionally all base types, where a base comparison makes sense, i.e. PolyZq, PolynomialRingZq, Zq

Testing

• I added basic working examples (possibly in doc-comment)
• I triggered all possible errors in my test in every possible way
• I included tests for all reasonable edge cases

Checklist:

• I have performed a self-review of my own code
  • The code provides good readability and maintainability s.t. it fulfills best practices like talking code, modularity, ...
    • The chosen implementation is not more complex than it has to be
  • My code should work as intended and no side effects occur (e.g. memory leaks)
  • The doc comments fit our style guide
  • I have credited related sources if needed