On MDR codes over a finite ring (Q274529): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1504/ijicot.2015.072612 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2294999590 / rank | |||
Normal rank | |||
Latest revision as of 09:00, 30 July 2024
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
