On (partial) unit memory codes based on Gabidulin codes
A. Wachter, V. R. Sidorenko, M. Bossert, V. V. Zyablov

This publication is cited in the following articles:

1. Hannes Bartz, Sven Puchinger, “Fast decoding of interleaved linearized Reed–Solomon codes and variants”, AMC, 2025  
2. Thomas Jerkovits, Hannes Bartz, Antonia Wachter-Zeh, 2023 IEEE International Symposium on Information Theory (ISIT), 2023, 820  
3. Sven Puchinger, Julian Renner, Johan Rosenkilde, “Generic Decoding in the Sum-Rank Metric”, IEEE Trans. Inform. Theory, 68:8 (2022), 5075  
4. Felicitas Hormann, Hannes Bartz, Sven Puchinger, 2022 IEEE International Symposium on Information Theory (ISIT), 2022, 7  
5. Umberto Martínez-Peñas, Mohannad Shehadeh, Frank R. Kschischang, “Codes in the Sum-Rank Metric: Fundamentals and Applications”, Foundations and Trends® in Communications and Information Theory, 19:5 (2022), 814  
6. Bartz H. Jerkovits T. Puchinger S. Rosenkilde J., “Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric”, IEEE Trans. Inf. Theory, 67:8 (2021), 5026–5050          
7. Martinez-Penas U., “Sum-Rank Bch Codes and Cyclic-Skew-Cyclic Codes”, IEEE Trans. Inf. Theory, 67:8 (2021), 5149–5167          
8. Bartz H. Puchinger S., “Decoding of Interleaved Linearized Reed-Solomon Codes With Applications to Network Coding”, 2021 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2021, 160–165      
9. Puchinger S. Rosenkilde J., “Bounds on List Decoding of Linearized Reed-Solomon Codes”, 2021 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2021, 154–159      
10. Cornelia Ott, Sven Puchinger, Martin Bossert, 2021 XVII International Symposium “Problems of Redundancy in Information and Control Systems” (REDUNDANCY), 2021, 119  
11. Sven Puchinger, Julian Renner, Johan Rosenkilde, 2020 IEEE International Symposium on Information Theory (ISIT), 2020, 54  
12. Martinez-Penas U., “Theory of Supports For Linear Codes Endowed With the Sum-Rank Metric”, Designs Codes Cryptogr., 87:10 (2019), 2295–2320          
13. Martinez-Penas U., “Skew and Linearized Reed-Solomon Codes and Maximum Sum Rank Distance Codes Over Any Division Ring”, J. Algebra, 504 (2018), 587–612        
14. Martinez-Penas U. Kschischang F.R., “Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes”, 2018 56Th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Annual Allerton Conference on Communication Control and Computing, IEEE, 2018, 702–709  
15. Umberto Martinez-Penas, Frank R. Kschischang, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2018, 702  
16. Umberto Martínez-Peñas, “Skew and linearized Reed–Solomon codes and maximum sum rank distance codes over any division ring”, Journal of Algebra, 504 (2018), 587  
17. Robert F. H. Fischer, Michael Cyran, Sebastian Stern, Johannes B. Huber, Signals and Communication Technology, Communications in Interference Limited Networks, 2016, 31  
18. Wachter-Zeh A., Stinner M., Sidorenko V., “Convolutional Codes in Rank Metric With Application To Random Network Coding”, IEEE Trans. Inf. Theory, 61:6 (2015), 3199–3213          
19. Wachter-Zeh A., Stinner M., Bossert M., “Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate”, 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), IEEE International Symposium on Information Theory, IEEE, 2012  
20. V. A. Malyshev, “Fine structure of a one-dimensional discrete point system”, Problems Inform. Transmission, 48:3 (2012), 283–296          
21. Antonia Wachter-Zeh, Vladimir Sidorenko, 2012 International Symposium on Network Coding (NetCod), 2012, 1  
22. Antonia Wachter-Zeh, Markus Stinner, Martin Bossert, 2012 IEEE International Symposium on Information Theory Proceedings, 2012, 2356  
23. Antonia Wachter, Vladimir Sidorenko, Martin Bossert, Victor Zyablov, 2011 IEEE International Symposium on Information Theory Proceedings, 2011, 2487