Answers are grounded in this paper and cite their sources.
In this correspondence, we study bounds on the Euclidean, Hamming, Lee, and Bachoc weights of codes over rings of order 4 similar to the Singleton bound and investigate the relationship between these bounds. Moreover, we give some characterizations of the codes meeting these bounds.
No takes yet. Share an insight, caveat, or question.
Dougherty et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: