Column Distances of Convolutional Codes Over <inline-formula> <tex-math notation="LaTeX">{\mathbb Z}_{p^r} </tex-math> </inline-formula>
From MaRDI portal
Publication:4615365
DOI10.1109/TIT.2018.2870436zbMATH Open1427.94099arXiv1708.00336OpenAlexW2914390732MaRDI QIDQ4615365FDOQ4615365
Authors: Raquel Pinto, Marisa Toste, Diego Napp 
Publication date: 28 January 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Rosenthal et al. introduced and thoroughly studied the notion of Maximum Distance Profile (MDP) convolutional codes over (non-binary) finite fields refining the classical notion of optimum distance profile, see for instance [18, p.164]. These codes have the property that their column distances are maximal among all codes of the same rate and the same degree. In this paper we aim at studying this fundamental notion in the context of convolutional codes over a finite ring. We extensively use the notion of p-encoder to present upper-bounds on the column distances which allow to introduce the notion of MDP in the context of finite rings. A constructive method for (non necessarily free) MDP convolutional codes over Z p r is presented.
Full work available at URL: https://arxiv.org/abs/1708.00336
Cited In (4)
- On the existence of non-catastrophic \(p\)-encoders of \((2, 1)\) convolutional codes over \(\mathbb{Z}_{p^2}\)
- List decoding of convolutional codes over integer residue rings
- Noncatastrophic convolutional codes over a finite ring
- Convolutional codes over finite chain rings, MDP codes and their characterization
This page was built for publication: Column Distances of Convolutional Codes Over <inline-formula> <tex-math notation="LaTeX">${\mathbb Z}_{p^r}$ </tex-math> </inline-formula>
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615365)
