"Maximum distance separable repeated-root constacyclic codes over $\mathbb ..."

Hai Q. Dinh, Pramod Kumar Kewat, Nilay Kumar Mondal (2024)

> Home

Details and statistics

DOI: 10.1007/S00200-022-00568-1

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aaecc/DinhKM24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aaecc/DinhKM24
Hai Q. Dinh, Pramod Kumar Kewat, Nilay Kumar Mondal:
Maximum distance separable repeated-root constacyclic codes over $\mathbb {F}_{2^m}+u\mathbb {F}_{2^m}$ with respect to the Lee distance. Appl. Algebra Eng. Commun. Comput. 35(4): 557-571 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.