top of page
Network coding Rate Region computed from Region of Entropic vectors - Candidacy Exam Drexel 2015
MY RESEARCH BLOG
Orbits Data Structure, ranks and unranks for enumeration, points of projective spaces in a order Schreier trees-Construction of (n,k, q, dmin≥3) codes
from Bayreuth U.
Brilawski-Lucas Lemma
Uniquely representation of Matroids
Burnside Cauchy Frobenius lemma - M. Wild enumeration of Binary linear codes
Enumeration of Isometries of Binary linear codes through transversal of double group action - M. Wild
Analytic construction of Isometries of Binary linear codes - Comprehensive talk, based on A.Kerber, Fripertinger, Laue - Bayreuth U.
Construction of Isomorphic classes with finite group actions, reduction of complexity in computation and sampling strategies- Bayreuth U.
Construction of Isomometries by linear Groups, Canonic Actions, Restrictions to Projective spaces, Triple Group action Characterization from Bayreuth U.
Formulation- Bijection linear isometry classes of projective (𝑛,≥ 𝑘, ≥ d min,q) codes
and set of orbits of n- sets
from Bayreuth U.
Schmalz lieterspiel adapted Algorithm for computing binary linear codes by Beten and Braun- Bayreuth U. P1
Schmalz lieterspiel adapted Algorithm for computing binary linear codes by Beten and Braun- Bayreuth U. P2
Partition Representabilty of Matroids, from F.Matus.
Minimal invasive Surgery Robots
Medical Robotics Research
Drexel 2013.
Probabilistic Conditional independence structures and Matroid Theory from F.Matus
Infinite Minors characterization of (simple) semimatroids from F.Matus
Forbidden minors of P-representability from F. Matus research
Algebraic Matroids containing Fano & Non Fanominors as restrictions which are not partition representable
bottom of page