Document is current

Any future updates will be listed below

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>$$

Crossref DOI link: https://doi.org/10.1007/s10623-023-01185-w

Published Online: 2023-02-15

Published Print: 2023-05

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark