Skip to content

Opening book details…

About this Computer Science article

A note on “H. Q. Dinh et al., Hamming distance of repeated-root constacyclic codes of length $$2p^{s}$$ over $${\mathbb{F}} {p^{m}}+ u{\mathbb{F}} {p^{m}}$$” by Laaouine, Jamal (author);Charkani, Mohammed Elhassani (author) is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Laaouine, Jamal (author);Charkani, Mohammed Elhassani (author)
Publisher
Springer Science and Business Media LLC
Published
2023
Field
Computer Science (Physical Sciences)