Convolutional Codes With Maximum Column Sum Rank for Network Streaming

From MaRDI portal
Publication:2976752

DOI10.1109/TIT.2016.2555949zbMATH Open1359.94754arXiv1506.03792OpenAlexW2340260419MaRDI QIDQ2976752FDOQ2976752

Ahmed Z. Badr, Rafid Mahmood, Ashish Khisti

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We introduce a metric known as the column sum rank, that parallels column Hamming distance when streaming over a network with link failures. We prove rank analogues of several known column Hamming distance properties and introduce a new family of convolutional codes that maximize the column sum rank up to the code memory. Our construction involves finding a class of super-regular matrices that preserve this property after multiplication with non-singular block diagonal matrices in the ground field.


Full work available at URL: https://arxiv.org/abs/1506.03792







Cited In (14)





This page was built for publication: Convolutional Codes With Maximum Column Sum Rank for Network Streaming

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