On MDR codes over a finite ring (Q274529): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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)]. | |||
| Property / review text: 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)]. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 94B27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6572837 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
MDR codes | |||
| Property / zbMATH Keywords: MDR codes / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum distance with respect to rank codes | |||
| Property / zbMATH Keywords: maximum distance with respect to rank codes / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
singleton type bounds | |||
| Property / zbMATH Keywords: singleton type bounds / rank | |||
Normal rank | |||
Revision as of 16:14, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On MDR codes over a finite ring |
scientific article |
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
