A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring $$\mathbb {F}_{2^r}[u]/<u^e>$$
A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring $$\mathbb {F}_{2^r}[u]/<u^e>$$
Create your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started