On MDR codes over a finite ring

DOI10.1504/IJICOT.2015.072612MaRDI QIDQ274529zbMATH OpenOpenAlexFDO

Authors Mohammed El Oued

Publication date 22 April 2016

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijicot.2015.072612

zbMATH Keywords

maximum distance with respect to rank codesMDR codessingleton type bounds

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

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)].

Recommendations

• MDR codes over Z/sub k/
• MDS convolutional codes over a finite ring
• Note on MDS codes over the integers modulo p^m
• MDS and self-dual codes over rings
• MDS codes over finite principal ideal rings

Cited in

(8)

• MDS codes over finite principal ideal rings
• Higher weights and near-MDR codes over chain rings
• Generalized bilinear forms graphs and MRD codes over a residue class ring
• Further results on higher weights of codes over finite rings
• MDR codes over Z/sub k/
• The dual of convolutional codes over \(\mathbb {Z}_{p^r}\)
• Noncatastrophic convolutional codes over a finite ring
• On the existence of non-catastrophic \(p\)-encoders of \((2, 1)\) convolutional codes over \(\mathbb{Z}_{p^2}\)

This page was built for publication: On MDR codes over a finite ring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q274529)