Login / Signup

Maximum distance separable repeated-root constacyclic codes over $\mathbb {F}_{2^m}+u\mathbb {F}_{2^m}$ with respect to the Lee distance.

Hai Q. DinhPramod Kumar KewatNilay Kumar Mondal
Published in: Appl. Algebra Eng. Commun. Comput. (2024)
Keyphrases
  • maximum distance
  • vertex set
  • hilbert space
  • special case
  • data points
  • reduction method
  • weighted graph
  • error correction
  • distance measure
  • level set
  • approximation algorithms
  • undirected graph