On MDR codes over a finite ring (Q274529)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6572837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On MDR codes over a finite ring |
scientific article; zbMATH DE number 6572837 |
Statements
On MDR codes over a finite ring (English)
0 references
22 April 2016
0 references
Summary: Our aim is to study codes over \(\mathbb{Z}_{p^r}\) satisfying two distinct Singleton type bounds. We describe the smallest free code containing an MDR code and give explicit expressions for the submodules quotients defined in [\textit{G. H. Norton} and \textit{A. Sălăgean}, IEEE Trans. Inf. Theory 46, No. 3, 1060--1067 (2000; Zbl 0963.94043)].
0 references
MDR codes
0 references
maximum distance with respect to rank codes
0 references
singleton type bounds
0 references
0.8246855735778809
0 references
0.804093599319458
0 references
0.7890848517417908
0 references
0.7713178396224976
0 references
0.770449697971344
0 references
