Convolutional Codes With Maximum Column Sum Rank for Network Streaming
From MaRDI portal
Publication:2976752
DOI10.1109/TIT.2016.2555949zbMath1359.94754arXiv1506.03792OpenAlexW2340260419MaRDI QIDQ2976752
Ahmed Z. Badr, Rafid Mahmood, Ashish Khisti
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.03792
Related Items (13)
Sum-rank product codes and bounds on the minimum distance ⋮ Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring ⋮ On Optimal Extended Row Distance Profile ⋮ Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ Systematic maximum sum rank codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Weighted Reed–Solomon convolutional codes ⋮ MDS 2D convolutional codes with optimal 1D horizontal projections ⋮ Concatenation of convolutional codes and rank metric codes for multi-shot network coding ⋮ A new rank metric for convolutional codes ⋮ Block Toeplitz matrices for burst-correcting convolutional codes ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
This page was built for publication: Convolutional Codes With Maximum Column Sum Rank for Network Streaming
