Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings

Yadav, M. R.; Sharma, Anuradha

doi:10.1016/j.disc.2020.112152

Discrete Mathematics

2021

DOI: 10.1016/j.disc.2020.112152

|View full text |Cite|

Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings

M. R. Yadav

Anuradha Sharma

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2024

Publication Types

Select...

Article4

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

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

Yadav

Sharma

2023

Des. Codes Cryptogr.

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings

Cited by 4 publications

References 26 publications

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

Construction and enumeration of self-orthogonal and self-dual codes over Galois rings of even characteristic

Enumeration formulae for self-orthogonal, self-dual and complementary-dual additive cyclic codes over finite commutative chain rings

Contact Info

Product

Resources

About