Marisa Toste
Marisa Toste has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Diego Napp
Department of Mathematics, University of Alicante, Alicante, Spain
4 shared publications - Raquel Pinto
CIDMA—Center for Research and Development in Mathematics and Applications, Department of Mathematics, University of Aveiro, 3810-193 Aveiro, Portugal
4 shared publications - Elif Saçıkara
Institute of Mathematics, University of Zurich, Zurich, Switzerland
1 shared publication Mohammed El Oued
High Institute of Maths and Computer Science of Monastir
1 shared publication
Latest Publications
- 24 September 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 614, 376-393
A matrix based list decoding algorithm for linear codes over integer residue rings
- 24 September 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 614, 376-393
A matrix based list decoding algorithm for linear codes over integer residue rings
- Open Access
- 17 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (2) , 1063-1071
Column Distances of Convolutional Codes Over ${\mathbb Z}_{p^r}$Maximum Distance Profile codes over finite nonbinary fields have been introduced and thoroughly studied in the last decade. These codes have the property that their column distances are maximal among all codes of the same rate and degree. In this paper we aim at studying this fundamental concept in the context of convolutional codes over a finite ring. We extensively use the concept of p-encoder to establish the theoretical framework and derive several bounds on the column distances. In particular, a method for constructing (not necessarily free) Maximum Distance Profile convolutional codes over Zpr is presented.
- 17 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (2) , 1063-1071
Open AccessColumn Distances of Convolutional Codes Over ${\mathbb Z}_{p^r}$Maximum Distance Profile codes over finite nonbinary fields have been introduced and thoroughly studied in the last decade. These codes have the property that their column distances are maximal among all codes of the same rate and degree. In this paper we aim at studying this fundamental concept in the context of convolutional codes over a finite ring. We extensively use the concept of p-encoder to establish the theoretical framework and derive several bounds on the column distances. In particular, a method for constructing (not necessarily free) Maximum Distance Profile convolutional codes over Zpr is presented.
- 4 March 2017
- Published by Springer Nature in Springer Proceedings in Mathematics & Statistics
- p. 79-91
The Dual of Convolutional Codes Over ${\mathbb {Z}}_{p^r}$- 4 March 2017
- Published by Springer Nature in Springer Proceedings in Mathematics & Statistics
- p. 79-91
The Dual of Convolutional Codes Over ${\mathbb {Z}}_{p^r}$- 15 April 2016
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 83 (1) , 101-114
On MDS convolutional codes over ${\mathbb {Z}}_{p^{r}}$ Z p r- 15 April 2016
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 83 (1) , 101-114
On MDS convolutional codes over ${\mathbb {Z}}_{p^{r}}$ Z p r